924C Riverside Curio

最新推荐文章于 2021-02-02 22:08:29 发布

lvmaooi

最新推荐文章于 2021-02-02 22:08:29 发布

阅读量403

点赞数

分类专栏：暴力乱搞

本文链接：https://blog.csdn.net/lvmaooi/article/details/79700017

版权

暴力乱搞专栏收录该内容

4 篇文章 0 订阅

订阅专栏

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 $m_i$ .

Define $d_i$ 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 $d_i$ 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 $m_1, m_2$ , …, $m_n$ $(0 ≤ m_i < 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

inputCopy

6
0 1 0 3 0 2

output

inputCopy

5
0 1 2 1 2

output

inputCopy

5
0 1 1 2 2

output

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 total number of marks underwater is 0 + 0 + 2 + 0 + 3 + 1 = 6.

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

大概意思就是说，每天画一条水平线（若与之前的重合则相当于线的数量不变，每天告诉你画的这条线上的线有多少条）。要每天这条线下的线的数量之和最小，求这个最小值。
传送门！！！
$\\$
$\\$
$\\$
$\\$
$\\$
$\\$
$\\$

解：

感觉此题很妙妙啊，首先分析得出要是线下数量最少，因为线上是定值，所以转而求每天线的总数最少。
设第 $i$ 天，线上数为 $m_i$ ，线下数为 $d_i$ ，线总数为 $t_i$ 。很明显 $t_i=m_i+1+d_i$ 。
其次我们列出几个限制条件：
$1.t_i≥t_{i-1}$
$2.t_i≥m_i+1$
$3.t_i\leq t_{i-1}+1$ （因为每天只能画一条线）
对于前两个条件，我们从左向右递推，可以求出每天满足条件的最小值。（此时不满足第三个条件。）如何处理第三个条件？我们会想到从右向左递推，如果 $t_i+1<t_{i+1}$ ，那么把 $t_i$ 赋值为 $t_{i+1}$ ，继续递推。
然后，居然就完了！！！
贴上代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int m[100005],d[100005],t[100005];
int n;
long long ans;

int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
      scanf("%d",&m[i]);
    for(int i=1;i<=n;i++)
      t[i]=max(t[i-1],m[i]+1);
    for(int i=n-1;i>=1;i--)
      if(t[i]<t[i+1]-1)
        t[i]=t[i+1]-1;
    for(int i=1;i<=n;i++)
      ans+=t[i]-1-m[i];
    cout<<ans;
}