View Code of Problem 19

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n;
	while(cin>>n&&n!=0) {
		int a[n+2],ans[n+2],war=-999999;
		ans[0]=0;
		for(int i=1; i<=n; ++i) {
			scanf("%d",&a[i]);
			ans[i]=a[i];
		}
		for(int i=1; i<=n; ++i) {
			ans[i]=max(ans[i-1]+a[i],a[i]);
			war=max(ans[i],war);
		}
		cout<<war<<endl;
	}
	return 0;
}