杭电 acm 1003 Max Sum(dp最大子序列)

Max Sum

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

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

We have carefully selected several similar problems for you:  1176 1069 1058 1159 1257 

#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std; 
int main()
{
    int n,m,a[100001],sum,MAX=0;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		memset(a,0,sizeof(a));
		cin>>m;
		for(int j=1;j<=m;j++)
		{ 
		 cin>>a[j];
		} 
		sum=a[1],MAX=a[1];
		int x=1,y=1,z=1;
		 for(int j=2;j<=m;j++)
		 {
		 	if(sum+a[j]<a[j])
		 	{
		 		sum=a[j];
		 		z=j;
			 }
			 else
			 sum+=a[j];
			 if(sum>MAX)
			 {
			 	MAX=sum;
			 	y=j;
			 	x=z;
			 }
		 }
	  cout<<"Case "<<i<<":"<<endl;
	  cout<<MAX<<" "<<x<<" "<<y;
	  if(i!=n)
	  cout<<endl<<endl;
	  else
	  cout<<endl;
	}
	return 0;
 } 

开始用数组进行存数，超时，后来用MAX和SMALL分别存下起始相同结束不同的地方的数字段和以及起始不同结束相同的数字段最大和，再次超时，最终简化成了现在的这个样子。。。