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 sum,max;
int temp,s;
int T;
int N,M;
int start,end,count=0;
scanf("%d",&T);
while(T--){
count++;
scanf("%d",&N);
sum=0;
max=-1001;
start=0;
end=0;
s=0;
temp=0;
while(N--){
scanf("%d",&M);
sum+=M;
if(sum>max){
max=sum;
start=s;
end=s+temp;
}
temp++;
if(sum<0){
s+=temp;
sum=0;
temp=0;
}
}
if(count!=1){
printf("\n");
}
printf("Case %d:\n",count);
printf("%d %d %d\n",max,start+1,end+1);
}
return 0;
}