Max Sum

Max Sum

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

Total Submission(s) : 188   Accepted Submission(s) : 50

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

  
  

 

Author

Ignatius.L

 

#include <stdio.h>
#include<time.h>

int a[100000 + 20];
int main()
{
	int L, T,R,N,c=1,markL,markR,first=1;
	int i, j;
	//freopen("g:\\in.txt", "r", stdin);
	scanf("%d", &T);
	while (T--)
	{
		markL = L = 1;	a[0] = 0;	
		scanf("%d", &N);
		for (i = 1; i <= N; i++)
			scanf("%d", &a[i]);
		for (markR=R = 1; R <= N; R++)
		{
			if (a[R - 1] < 0)
				L = R;
			else 
				a[R] += a[R - 1];
			if (a[R]>a[markR])
			{
				markR = R;
				markL = L;
			}
		}
		if (!first)		
			printf("\n");

		printf("Case %d:\n", c++);
		printf("%d %d %d\n", a[markR], markL, markR);
		first = 0;
	}

	//printf("%lf秒\n", (double)clock() / CLOCKS_PER_SEC);
	return 0;
}