#include<bits/stdc++.h>
using namespace std;
int n,a[1000006],b[100006],mx;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=n;i++){
		if(b[i-1]>0)b[i]=b[i-1]+a[i];
		else b[i]=a[i];
	}
	for(int i=1;i<=n;i++)mx=max(mx,b[i]);
	cout<<mx;
	return 0;
}

#include<bit/stdc++.h>
using namespace std;
long long n,x,s,p,m,a[1000100];
int main()
{
cin >> n;
for (int i = 1;i <= n; ++ i) cin >> a[i];
for (int i = 1;i <= n; ++ i)
{
if (s >= 0) s += a[i];//小于0不如重开
else s = a[i];
m = max (m,s);//取最大值
}
cout >> m;
}

复制=CE

#include<bits/stdc++.h>
using namespace std;
long long b[100001];
int n,a[100001],res=0;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(b[i-1]>0)b[i]=b[i-1]+a[i];
		else b[i]=a[i];
	}
	for(int i=1;i<=n;i++){
		if(res<b[i])res=b[i];
	}
	cout<<res;
}

#include<bits/stdc++.h>
using namespace std;
int n,a[100005],b[100005],ans;
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++){
if(b[i-1]>=0) b[i]=b[i-1]+a[i];
else b[i]=a[i];
}
for(int i=1;i<=n;i++){
if(ans<b[i]) ans=b[i];
}
cout<<ans;
return 0;
}

#include<bits/stdc++.h> using namespace std; long long b[100001]; int n,a[100001],res=0; int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; if(b[i-1]>0)b[i]=b[i-1]+a[i]; else b[i]=a[i]; } for(int i=1;i<=n;i++){ if(res<b[i])res=b[i]; } cout<<res; }