Z-Frog 3#10799
There are stones, numbered , , ..., . For each (1 \le i \le n), the height of stone is h_i. Here h_1 < h_2 < \ldots < h_n holds.
There is a frog who is initially on stone . He will repeat the following action some number of times to reach stone :
- If the frog is currently on Stone , jump to one of the following: stone i + 1, i + 2, ..., . Here, a cost of (h_j - h_i)^2 + c is incurred, where is the stone to land on.
Find the minimum possible total cost incurred before the frog reaches stone .
First line contains two integers (2 \le n \le 2 \cdot 10^5) and (1 \le c \le 10^{12}). Second line contains the heights of stones 1 \le h_1 < h_2 < \ldots < h_n \le 10^6.
Print the minimum possible total cost incurred.
Example 1