hdu 1003 Max Sum

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 107975    Accepted Submission(s): 24868

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
  
  
  
  


  
  
  
  

   
   
#include<stdio.h>
#include<string.h>
#include<math.h>
int a[100005];	
int main()
{
	int n,m,i,j,t,s,max,k1,k2,k,sum,cnt;
	scanf("%d",&t);
	for(k=1;k<=t;k++)
	{
		printf("Case %d:\n",k);
        scanf("%d",&n);
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		sum=cnt=0;
		max=-1005;
        for(i=1;i<=n;i++)
		{
			cnt++;  
			sum+=a[i];
			if(sum>max) 
			{
				k1=cnt;     // k1记住重从开始计数 到产生最大花了多少次
				k2=i;       // 用来记录子串的结束下标
				max=sum;
			}
			if(sum<0)       // sum<0 说明前面的都不需要 重新开始计数
			{
				cnt=0;
				sum=0;
			}
		}
		printf("%d %d %d\n",max,k2-k1+1,k2);  // k2-k1+1 既得子串的开始下标
		if(k<t) printf("\n");
	}
	return 0;
}