#include<cstdio>
#include<cstring>
#include<cmath>
#include<climits>
#include<cctype>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#include<string>
#include<stack>
#define ll __int64
#define MAX 100010
#define eps 1e-8
#define INF INT_MAX
using namespace std;
ll a[MAX],b[MAX],d[MAX];
int main(){
int n;
while (scanf("%d",&n) != EOF){
for (int i = 1; i<=n; i++){
scanf("%I64d",&a[i]);
}
a[0] = 0;
for (int i = 1; i<=n; i++){
b[i] = a[i] - a[i-1];
}
//for (int i = 1; i<=n; i++) printf("%lld ",b[i]); printf("\n");
d[0] = 0;
for (int i = 1; i<=n; i++){
if (d[i-1] > 0){
d[i] = d[i-1] + b[i];
}
else
d[i] = b[i];
}
ll ans = 0LL;
for (int i = 1; i<=n; i++) ans = max(ans,d[i]);
printf("%I64d\n",ans);
}
return 0;
}
Codeforces Round #264 (Div. 2) 463B Caisa and Pylons
最新推荐文章于 2019-05-28 18:56:03 发布