杭电HDOJ1024 解题报告

Max Sum Plus Plus

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

Problem Description

Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem.

Given a consecutive number sequence S ₁, S ₂, S ₃, S ₄ ... S _x, ... S _n (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ S _x ≤ 32767). We define a function sum(i, j) = S _i + ... + S _j (1 ≤ i ≤ j ≤ n).

Now given an integer m (m > 0), your task is to find m pairs of i and j which make sum(i ₁, j ₁) + sum(i ₂, j ₂) + sum(i ₃, j ₃) + ... + sum(i _m, j _m) maximal (i _x ≤ i _y ≤ j _x or i _x ≤ j _y ≤ j _x is not allowed).

But I`m lazy, I don't want to write a special-judge module, so you don't have to output m pairs of i and j, just output the maximal summation of sum(i _x, j _x)(1 ≤ x ≤ m) instead. ^_^

 

Input

Each test case will begin with two integers m and n, followed by n integers S ₁, S ₂, S ₃ ... S _n.
Process to the end of file.

 

Output

Output the maximal summation described above in one line.

 

Sample Input

  
  

   
   1 3 1 2 3
2 6 -1 4 -2 3 -2 3
  
  

 

Sample Output

  
  

   
   6
8


   
   

    
    

     
     Hint
    
    
Huge input, scanf and dynamic programming is recommended.

   
   
   
    
  
  

 

Author

JGShining（极光炫影）

杭电HDOJ 1024 

解题思路：

DP求解。

（未完待续）

下次切到windows系统再上DP图。

代码

#include <stdio.h>
#define  MIN -327680000
#define  N 1000010
int a[N],b[N],M[N];
int main(int argc, const char * argv[])
{
    int i,j,m,n,max;
    while(scanf("%d%d",&m,&n)!=EOF)
    {
        if(m>n)  m=n;
        max=0;
        for(i=0;i<=n;i++)
        {
            if(i==0) a[0]=0;
            else scanf("%d",&a[i]);
            b[i]=0;M[i]=0;
        }
        for(i=1;i<=m;i++)
        {
            max=MIN;
            for(j=i;j<=n;j++)
            {
                b[j]=b[j-1]<M[j-1]?M[j-1]+a[j]:b[j-1]+a[j];
                if(max!=MIN) M[j-1]=max;
                if(b[j]>max) max=b[j];
            }
            M[j-1]=max;
        }
        printf("%d\n",max);
    }
    return 0;
}