https://www.luogu.org/problem/P1115
#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#define ll long long
using namespace std;
const int NN=200005;
ll n,f[NN],ans=-1000000000;
int main(){
scanf("%lld",&n);
for(int i=1;i<=n;i++) scanf("%lld",&f[i]);
for(int i=2;i<=n;i++){
f[i]=max(f[i],f[i-1]+f[i]);
ans=max(ans,f[i]);
}
printf("%lld\n",ans);
return 0;
}