题目
方法
给定数组所对应的差分数组具有唯一性,而目标状态的差分数组为全零
所以倒过来想,把全零数组转化为题目的差分数组,最少操作步数即为答案
步数即为差分数组正项和~
参考:玩具谜题
码(huateng)
#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;
#define N 100005
int n;
long long ans;
int d[N];
int main()
{
// freopen("road.in","r",stdin);
// freopen("road.out","w",stdout);
scanf("%d",&n);
for(int i=1; i<=n; i++){
scanf("%d",&d[i]);
if(d[i]-d[i-1] > 0) ans += (long long)(d[i]-d[i-1]);
}
printf("%lld",ans);
return 0;
}