ds 1.3 相亲大会

/***************
Problem from :ds
Problem describe :
   求最大连续子串和  
data: 2016.12.1
****************/

#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<ctime>
#include<cstring>
#include<vector>
#include<string>
#define ll __int64
#define inf 0x3f3f3f3f3f
using namespace std;

int main()
{
//  freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
	int x, n, sum=0, MAX;
	while(~scanf("%d", &n))
	{
		sum=0;
		MAX = -inf; 
		while(n--)
		{
			scanf("%d", &x);
			sum+=x;
			if(sum > MAX) MAX = sum;
			if(sum < 0) sum=0;
		}
		printf("%d\n", MAX);
	}
	return 0;
}