Max Sum

C - Max Sum

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status

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

//输出格式如此智障，醉了。 
//没啥好说的，简单dp，不停与前一个输入的数加和比较，得出最大值，注意记录初末位置； 
#include<stdio.h>//c
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;


int main(){
	int dp[100010],start[100010];
	int t,n,M,end,s;
	cin>>t;
	int text = 1;
	while(t--){
		memset(dp,0,sizeof(dp));
		memset(start,0,sizeof(start));
		dp[0] = 0;M = 0;start[1] = 1;s = 1;end = 1;
		cin>>n;
		cin>>dp[1];M = dp[1];
		for(int i=2; i<=n; i++){
			
			cin>>dp[i];
			if(dp[i]+dp[i-1] < dp[i]){
				start[i] = 1;
			}
			dp[i] = max(dp[i]+dp[i-1],dp[i]);
			if(M<dp[i]){
				end = i;	M = dp[i];
			}
		}
		for(int i=end; i >= 1; i--){
			if(start[i] == 1){
				s = i;	break;
			}
		}
		printf("Case %d:\n%d %d %d\n",text++,M,s,end);
		if(t!=0){
			printf("\n");
		}
		
	}
	
	return 0;
}