Codeforced 957D - Riverside Curio

Problem Description

Arkady decides to observe a river for n consecutive days. The river's water level on each day is equal to some real value.

Arkady goes to the riverside each day and makes a mark on the side of the channel at the height of the water level, but if it coincides with a mark made before, no new mark is created. The water does not wash the marks away. Arkady writes down the number of marks strictly above the water level each day, on the i-th day this value is equal to mi.

Define di as the number of marks strictly under the water level on the i-th day. You are to find out the minimum possible sum of di over all days. There are no marks on the channel before the first day.

 

Input  

The first line contains a single positive integer n (1 ≤ n ≤ 105) — the number of days.

The second line contains n space-separated integers m1, m2, ..., mn (0 ≤ mi < i) — the number of marks strictly above the water on each day.

 

Output   

Output one single integer — the minimum possible sum of the number of marks strictly below the water level among all days.

 

Examples 

input
6 0 1 0 3 0 2
output
6
input
5 0 1 2 1 2
output
1
input
5 0 1 1 2 2
output
0

 

Note

In the first example, the following figure shows an optimal case.

 

Note that on day 3, a new mark should be created because if not, there cannot be 3 marks above water on day 4. The totalnumber of marks underwater is 0 + 0 + 2 + 0 + 3 + 1 = 6.

In the second example, the following figure shows an optimal case.

 

题意：

你用n天时间去观察一条河，这条河的水位每天都有可能改变，所有你每天都会在当前水位上画一条线来标注（这个线永远都不会消失），当然啦，如果这个水位刚好和之前某天水位一致，也就是已经有线和水面平齐，那么当然就不需要再标记了。现在告诉你每天可以看到的水位线数量m[i]，求出∑d[i]的最小值，其中d[i]表示第i天水底下的标记线的个数
 

思路：