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.
输入
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).
输出
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.
样例输入
2 5 6 -1 5 4 -7 7 0 6 -1 1 -6 7 -5
样例输出
Case 1: 14 1 4 Case 2: 7 1 6
#include<stdio.h> int main(){ int t,cas,fir,end,i,n,max,sum,a[100000],j; scanf("%d",&t);cas=1; while(t--){ scanf("%d",&n); for(i=0;i<n;i++) scanf("%d",&a[i]); max=-999999;sum=-1;fir=end=1; for(i=0;i<n;i++){ if(sum<0){ j=i; sum=a[i]; } else{ sum+=a[i]; } if(sum>max){ max=sum; fir=j+1; end=i+1; } } printf("Case %d:\n",cas++); printf("%d %d %d\n",max,fir,end); if(t) printf("\n"); } return 0; }