Max Sum hdu+最大子序列和

Max Sum

Time Limit: 1000MS

Memory Limit: 32768KB

64bit IO Format: %I64d & %I64u

[Submit]   [Go Back]   [Status]  

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：推出其状态方程为sum[i] = max{sum[i-1]+a[i],a[i]}，理解了状态方程，代码也就不难写了。

代码：

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int num[100010];
int N;
int _max;int I,J;
void dp(int i,int j,int n);
int main()
{
  int n;cin>>n;int k=0;;
  while(n--)
  {
    _max=-9999;I=0;J=0;
    int end,star;
    scanf("%d",&N);
    int sum=0;
    for(int i=0;i<N;i++)
    {
        scanf("%d",&num[i]);
    }
    for(int i=0;i<N;i++)
    {
        if(sum+num[i]<num[i])
         {sum=num[i];I=i;}///
        else
          sum+=num[i];///
        if(sum>_max)
        {_max=sum;end=i;star=I;}///记录器最大值，及其区间

    }
     cout<<"Case "<<++k<<":"<<endl;
    cout<<_max<<" "<<star+1<<" "<<end+1<<endl;
    if(n!=0)
    cout<<endl;
  }
  return 0;
}
void dp(int i,int j,int n)
{
}