CF713C.Sonya and Problem Wihtout a Legend

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Sonya was unable to think of a story for this problem, so here comes the formal description.

You are given the array containing $n$ positive integers. At one turn you can pick any element and increase or decrease it by $1$ . The goal is the make the array strictly increasing by making the minimum possible number of operations. You are allowed to change elements in any way, they can become negative or equal to $0$ .

输入格式

The first line of the input contains a single integer $n$ ( $1<=n<=3000$ ) — the length of the array.

Next line contains $n$ integer $a_{i}$ ( $1<=a_{i}<=10^{9}$ ).

输出格式

Print the minimum number of operation required to make the array strictly increasing.

输入输出样例

输入#1
```
7
2 1 5 11 5 9 11
```
输出#1
```
9
```
输入#2
```
5
5 4 3 2 1
```
输出#2
```
12
```

说明/提示

In the first sample, the array is going to look as follows:

$2$ $3$ $5$ $6$ $7$ $9$ $11$

$|2-2|+|1-3|+|5-5|+|11-6|+|5-7|+|9-9|+|11-11|=9$

And for the second sample:

$1$ $2$ $3$ $4$ $5$

$|5-1|+|4-2|+|3-3|+|2-4|+|1-5|=12$

首页