传统题 1000ms 256MiB

C - Step

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

C - Step

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:

NN

A1A_1 \ldots ANA_N

Output

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


5
2 1 5 4 3
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.


5
3 3 3 3 3
0

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

2024寒假入门组刷题营(十三)

未参加
状态
已结束
规则
ACM/ICPC
题目
8
开始于
2024-2-13 13:30
结束于
2024-2-13 15:30
持续时间
2 小时
主持人
参赛人数
10