Max Sum

Problem Description

Given a sequence a[1],a[2],a[3]......a[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<stdio.h>
int main()
{
    int t,m;
    int a,i,n,temp,max,s,e,k;
    scanf("%d",&t);
    for(m=0;m<t;m++){
        s=e=k=0;
        scanf("%d",&n);
        max=-1001;temp=0;//all the integers are between -1000 and 1000
        for(i=0;i<n;i++){
            scanf("%d",&a);
            temp+=a;
            if(temp>max){
                e=i;
                s=k;
                max=temp;
            }//记录起始和终止值
            if(temp<0){
                temp=0;
                k=i+1;
            }//temp<0重新开始，记录下新起始值
        }
        printf("Case %d: ",m+1);
        printf("%d %d %d ",max,s+1,e+1);
        if(m<t-1)
            printf(" ");
    }
    return 0;
}