1635: The Max Sub_Sum

Given an array of positive and negative integers, a Sub_Sum is the sum of consecutive integers with arbitrary length (greater than 0 at least) in the array. Your task: Find the max Sub_Sum of an array of integers

The input consists of serval test cases. Every case consists of two lines: The first line consists of only a postive integer N(1<=N<=100) which tells the lenth of the array; The second line consists of N integers. The value of the number in the array will have magnitude at least 0 and be within the range [0,10^1000]. A line consists of only a zero means the end of input.

Output the max Sub_Sum of each test case, one for a line

3
1 1 1
4
1 2 1 3
0

3
7