Max Sum
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
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>
#define M 100003
int T;
int N;
int start;
int end;
int stmp;
int tmp;
int max;
int number[M];
int main(void) {
int c=0;
scanf("%d",&T);
while(T--){
scanf("%d",&N);
for(int i=1;i<=N;i++)
scanf("%d",&number[i]);
max=-1000000000;
start=1;
end=1;
stmp=1;
tmp=0;
for(int i=1;i<=N;i++){
tmp+=number[i];
if(tmp>max){
start=stmp;
end=i;
max=tmp;
}
if(tmp<0){
stmp=i+1;
tmp=0;
}
}
printf("Case %d:\n",++c);
printf("%d %d %d\n",max,start,end);
if(T)
printf("\n");
}
return 0;
}