dp问题 求连续序列的最大和

Given a sequence a 1 1,a 2 2,a 3 3......a n n, your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14.
Input

The first line of the input contains an integer T(1<=T<=20) which means the number of test cases. Then T lines follow, each line starts with a number N(1<=N<=100000), then N integers followed(all the integers are between -1000 and 1000).

Output

For each test case, you should output two lines. The first line is "Case #:", # means the number of the test case. The second line contains three integers, the Max Sum in the sequence, the start position of the sub-sequence, the end position of the sub-sequence. If there are more than one result, output the first one. Output a blank line between two cases.

Sample Input

2
5 6 -1 5 4 -7
7 0 6 -1 1 -6 7 -5

Sample Output

Case 1:
14 1 4

Case 2:
7 1 6

#include <iostream>
#include <cstdio>
using namespace std;
int t,n;
int a[100005];

int main()
{
	int maxx,sum,before,now,j,l;
	cin>>t;
	for(j=1;j<=t;j++)
	{
		cin>>n;
		for(int i=1;i<=n;i++) 
		cin>>a[i];
	    l=before=now=1; sum=0; maxx=-0x7fffffff;
	    for(int i=1;i<=n;i++)
	    {
	    	sum+=a[i];
	    	if(sum>maxx)  {
	    		 maxx=sum;
	    		 now=i;
	    		 l=before;
	    	}
	    	
			if (sum<0){
	    		before=i+1;
	    		sum=0;
	    	}
	    }
	    
	    printf("Case %d:\n",j);
	    if(j!=t) printf("%d %d %d\n\n",maxx,l,now);
	     else printf("%d %d %d\n",maxx,l,now);
	}
}