A

A - Max Sum

 HDU - 1003

Time limit

1000 ms

Memory limit

32768 kB

OS

Windows

 

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

25 6 -1 5 4 -77 0 6 -1 1 -6 7 -5

Sample Output

Case 1:14 1 4Case 2:7 1 6

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;int main(){    int T,n,a[100001],i,k,sum,b,c,d,max;    scanf("%d",&T);    for(k=1;k<=T;k++)    {        scanf("%d",&n);        scanf("%d",&a[0]);        b=0;c=0;sum=a[0];max=a[0];d=0;        for(i=1;i<n;i++)        {            scanf("%d",&a[i]);            if(sum<0)            {                sum=0;                b=i;            }            sum=sum+a[i];             if(sum>max)            {                d=b;                max=sum;                c=i;            }        }        printf("Case %d:\n",k);        printf("%d %d %d\n",max,d+1,c+1);        if(k!=T)        {            printf("\n");        }    }return 0;}