B'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 <= i <= j <= 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 <= n <= 4 cdot 10^5 ). The second line contains n integers a_1,a_2, ldots a_n ( 1 <= a_i <= 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 . In the first example: In the fourth example from 1 to 4 : 1 rightarrow 3 rightarrow 4 -- the cost is min(1, 4, 4) cdot (3 - 1) ^ 2 + min(4, 4) cdot (4 - 3) ^ 2 = 4 + 4 = 8 . '...