HDU1003

Max Sum

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 106913    Accepted Submission(s): 24630

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





--------------------------------------------------------------分割线--------------------------------------------------------
DP题。大致思路：
先初始化：posbegin=posend=postemp=1   max=now=temp   
然后模拟过程：每次输入temp,如果now+temp<temp  更新now的值  否则让now=now+temp的值
比较now和max的值，更新
   
   
#include<stdio.h>
#include<string.h>
int main()
{
	int  T,i,j;
	int num[100005];
	scanf("%d",&T);
	for(j=1;j<=T;j++)
	{
		int n,posbegin,posend,postemp,now,temp,max;
		scanf("%d",&n);
		scanf("%d",&temp);
		posbegin=posend=postemp=1;
		max=now=temp;
		for(i=2;i<=n;i++)
		{
			scanf("%d",&temp);
			if(temp+now<temp)
			{
				now=temp;
				postemp=i;
			}
			else 
				now+=temp;
			if(now>max)
			{
				max=now;
				posbegin=postemp;
				posend=i;
			}
		}
		printf("Case %d:\n%d %d %d\n",j,max,posbegin,posend);
		if(j!=T)
			printf("\n");
	}
	return 0;
}