Problem:
Maximum Sum Sequence

Given a sequence of numbers a1, a2, a3, ..., an, find the maximum sum of a contiguous subsequence of those numbers. Note that, a subsequence of one element is also a contiquous subsequence.

Input

The input consists of multiple datasets. Each data set consists of:

n
a1
a2
.
.
an

You can assume that 1 ≤ n ≤ 5000 and -100000 ≤ ai ≤ 100000.

The input end with a line consisting of a single 0.

Output

For each dataset, print the maximum sum in a line.

Sample Input

7
-5
-1
6
4
9
-6
-7
13
1
2
3
2
-2
-1
1
2
3
2
1
-2
1
3
1000
-200
201
0

Output for the Sample Input

19
14
1001

Solution in C++ (judge verdict: Accepted)

#include <iostream>
#include <cmath>
using namespace std;
int main(){
	int n,num[5010],hoge,ans;
	while(cin>>n,n!=0){
	hoge=0;
	for(int i=0;i<n;i++)cin>>num[i];
	ans=num[0];
	for(int i=0;i<n;i++){
		hoge=0;
		for(int j=i;j<n;j++){
			hoge+=num[j];
			ans=max(ans,hoge);
		}
	}
		cout<<ans<<endl;
	}
}