B - Max Sum

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 a[100001];
int main(){
	int n,h,n1,i;
	scanf("%d",&n);
	h = n;
	while(n--){
		scanf("%d",&n1);
		for(i=0;i<n1;i++){
			scanf("%d",&a[i]);
		}
		int summax = -1000,sum=0,k=1,st=0,t;
		for(i=0;i<n1;i++){
			sum+=a[i];
			if(sum>summax){
				summax = sum;
				t = i+1;
				st = k;
			}
			if(sum<0){
				sum=0;
				k = i+2; 
			}
		}
			printf("Case %d:\n%d %d %d\n",h-n,summax,st,t);
			if(n){
				printf("\n");
			}
	
}
	return 0;
}