分析
直接贪心
最开始ans=a[1]
若a[i]>a[i-1] ans+=a[i]-a[i-1]
否则不改变ans的值
代码如下
#include<bits/stdc++.h>
using namespace std;
const int N=100050;
int n,a[N],ans;
int read(){
int sum=0,f=1;
char ch=getchar();
while(ch>'9'||ch<'0')
{
if(ch=='-')f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
sum=(sum<<3)+(sum<<1)+ch-'0';
ch=getchar();
}
return sum*f;
}
int main(){
// freopen("block.in","r",stdin);
// freopen("block.out","w",stdout);
n=read();
a[1]=read();
ans=a[1];
for(int i=2;i<=n;i++)
{
a[i]=read();
if(a[i]>a[i-1])ans+=a[i]-a[i-1];
}
cout<<ans;
return 0;
}