代码

#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
int n,d[100005],i,qian=0;
long long ans=0;
int main(){
	cin>>n;
	for(i=1;i<=n;i++){
		scanf("%d",&d[i]);
	}
	for(i=1;i<=n;i++){
		if(d[i]<=qian){
			qian=d[i];
		}
		else{
		    ans+=d[i]-qian;
			qian=d[i];
			
		}
	}
	printf("%lld",ans);
	return 0;
}

评测结果