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: Time Limit Exceeded)

#include <stdio.h>
#include <limits.h>
int main(){
  int i, max, num;
  int sum, a, b, get[100];
  while(1){
    scanf("%d", &num);
    if(num == 0){
      break;
    }
    max = INT_MIN;
    sum = 0;
    for(i=0;i<num;i++){
      scanf("%d",&get[i]);
    }
    for(a = num-1; a>= 0;a--){
      for(b = 0; b<=a;b++){
	for(i = b;i <=a;i++){
	  sum += get[i];
	}
	if(max < sum){
	  max = sum;
	}
	sum = 0;
      }
    }
    printf("%d\n", max);
  }
  return 0;
}