hdu 1024 Max Sum Plus Plus (滚动数组 &&动态规划)

Max Sum Plus Plus

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

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

暴力原始码 ：

1. for(int i=1;i<=m;++i){ 
2.             for(int j=i;j<=n;++j){ 
3.                 tmp=-inf; 
4.                 for(int k=i-1;k<=j-1;++k){ 
5.                     if(tmp<d[i-1][k])tmp=d[i-1][k]; 
6.                 } 
7.                 d[i][j]=max(d[i][j-1],tmp)+num[j]; 
8.             } 
9.         } 

因为是线性存储的所以可以用 pre【j】数组记录dp【i-1】【j】

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 0x3f3f3f3f
int pre[100003];
int dp[100003];
int a[100003];
int main()
{
    int n,m;
    while(~scanf("%d%d",&m,&n))
    {
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&a[i]);
        }
        memset(dp,0,sizeof(dp));
        memset(pre,0,sizeof(pre));
        int tmp=0;
        for(int i=1;i<=m;i++)
        {
            tmp=-N;
            for(int j=i;j<=n;j++)
            {
                dp[j]=max(dp[j-1],pre[j-1])+a[j];
                pre[j-1]=tmp;
                tmp=max(tmp,dp[j]);
            }
        }
        printf("%d\n",tmp);
    }
}