遍历,比前一个大加差值,小不用管,
#include<bits/stdc++.h>
using namespace std;
int ha[100010];
int n;
long long m;
int main(){
// freopen("road.in","r",stdin);
// freopen("road.out","w",stdout);
scanf("%d",&n);
for(int z=1;z<=n;++z) scanf("%d",&ha[z]);
for(int z=1;z<=n;++z) if(ha[z]>ha[z-1]) m+=(ha[z]-ha[z-1]);
printf("%lld",m);
}