#include<iostream>#include<math.h>using namespace std;int a[1000000];int main(){int t;cin>>t;if(t<1|t>20)return -1;else{int j=0;while(t--){int n,i,sum=0,max=-1000,one=1,two,temp=1;cin>>n;for(i=1;i<=n;++i)cin>>a[i];for(i=1;i<=n;++i){sum+=a[i];if(max<sum){max=sum;one=temp;two=i;}if(sum<0){sum=0;temp=i+1;}}cout<<"Case "<<++j<<":"<<endl;cout<<max<<" "<<one<<" "<<two<<endl;if(t)cout<<endl;}}}

Max Sum

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 4   Accepted Submission(s) : 3

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