题库练习 Wonderful Jump
← 上一题 下一题 →

A15646 | Wonderful Jump

时间限制1s
内存限制256MB
通过 / 提交0/0

题目描述

You are given an array of positive integers $a_1,a_2,\ldots,a_n$ of length $n$ .

In one operation you can jump from index $i$ to index $j$ ( $1 \le i \le j \le n$ ) by paying $\min(a_i, a_{i + 1}, \ldots, a_j) \cdot (j - i)^2$ eris.

For all $k$ from $1$ to $n$ , find the minimum number of eris needed to get from index $1$ to index $k$ .

输入格式

The first line contains a single integer $n$ ( $2 \le n \le 4 \cdot 10^5$ ).

The second line contains $n$ integers $a_1,a_2,\ldots a_n$ ( $1 \le a_i \le n$ ).

输出格式

Output $n$ integers — the $k$ -th integer is the minimum number of eris needed to reach index $k$ if you start from index $1$ .

输入输出样例

输入 #1
3
2 1 3
输出 #1
0 1 2
输入 #2
6
1 4 1 6 3 2
输出 #2
0 1 2 3 6 8
输入 #3
2
1 2
输出 #3
0 1
输入 #4
4
1 4 4 4
输出 #4
0 1 4 8
C++ 编辑器
输入
输出