101762: [AtCoder]ABC176 C - Step

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

Problem Statement

$N$ persons are standing in a row. The height of the $i$-th person from the front is $A_i$.

We want to have each person stand on a stool of some heights - at least zero - so that the following condition is satisfied for every person:

Condition: Nobody in front of the person is taller than the person. Here, the height of a person includes the stool.

Find the minimum total height of the stools needed to meet this goal.

Constraints

  • $1 \leq N \leq 2\times 10^5$
  • $1 \leq A_i \leq 10^9$
  • All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$
$A_1$ $\ldots$ $A_N$

Output

Print the minimum total height of the stools needed to meet the goal.


Sample Input 1

5
2 1 5 4 3

Sample Output 1

4

If the persons stand on stools of heights $0$, $1$, $0$, $1$, and $2$, respectively, their heights will be $2$, $2$, $5$, $5$, and $5$, satisfying the condition.

We cannot meet the goal with a smaller total height of the stools.


Sample Input 2

5
3 3 3 3 3

Sample Output 2

0

Giving a stool of height $0$ to everyone will work.

Input

题意翻译

有 $n$ 个数,第 $i$ 个数是 $a_i$ 。还有一个整数 $m$ ,其初始值为 $0$ 。对于每个 $a_i$ :如果它比它前面的所有数中的某个数小,那么就将它和 $m$ 同时加上 $1$ ,直至它前面没有比它小的数为止。问在所有操作完成之后 $m$ 的最小值。( $a_1$ 当然不用动)

加入题单

算法标签: