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

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>int s[100100];int main(){int i,t,n,temp,max,sum,start,end,j;scanf("%d",&n);for(i=1;i<=n;i++){scanf("%d",&t);for(j=0;j<t;j++){scanf("%d",&s[j]);}sum=s[0];max=s[0];temp=0;start=0;end=0;for(j=1;j<t;j++){if(sum<0){temp=j;sum=0;           } sum+=s[j];               if(sum>max){max=sum;end=j;start=temp;}}printf("Case %d:\n",i);printf("%d %d %d\n",max,start+1,end+1);if(i<n) printf("\n");}return 0;}