HDU 1003 Max Sum （动态规划）

Max Sum

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

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

 

Recommend

思路：求最大连续子序列。

#include<cstdio>
#include<iostream>
#include<cstring>
int a[100000];
int dp[100000];
using namespace std;

int main()
{
	int T;
	scanf("%d",&T);
	int k=1,t=T;
	while(T--)
	{
		memset(dp,0,sizeof(dp));
		int n;
		scanf("%d",&n);
		for(int i=0; i<n; i++)
			scanf("%d",&a[i]);
		int begin=0,end,BEGIN=0,END=0;
		int max=a[0];
		dp[0]=a[0];
		for(int i=1; i<n; i++)
		{
			if(dp[i-1]<0)	//如果前面的小于0了，则从a[i]重新开始 
			{
				dp[i]=a[i];
				begin=i;
				end=i;
			}
			else	//否则，加到dp[i]上  
			{
				dp[i]=dp[i-1]+a[i];
				end=i;
			}
			if(dp[i]>max)
			{
				max=dp[i];
				BEGIN=begin;
				END=end;
			}
		}
		printf("Case %d:\n",k);
		k++;
		printf("%d %d %d\n",max,BEGIN+1,END+1);
		if((k-1)!=t)
		  printf("\n");
	}
	return 0;
}