HDU 1024

Max Sum Plus Plus

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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. ^_^

 

#include<iostream>
using namespace std;

__int64 temp[2][1000001],a[1000001];
__int64 Max[2][1000001];

int max1(int a,int b)
{
    if(a>b) return a;
    return b;
}

int main()
{
    int n,m,t,i,j;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        temp[0][0]=temp[1][0]=0;
        Max[0][0]=Max[1][0]=0;
        for(i=1;i<=m;i++)
        {
            scanf("%I64d",a+i);
            temp[0][i]=temp[1][i]=0;
            Max[0][i]=Max[1][i]=0;
        }
        t=0;
        for(j=1;j<=n;j++)
        {
            t=1-t;
            Max[t][j]=a[j]+temp[1-t][j-1];
            temp[t][j]=Max[t][j];
            for(i=j+1;i<=m;i++)
            { 
                temp[t][i]=max1(temp[t][i-1],Max[1-t][i-1])+a[i];
                if(temp[t][i]>Max[t][i-1])
                {
                    Max[t][i]=temp[t][i];
                }
                else
                {
                    Max[t][i]=Max[t][i-1];
                }
            }
        }
        printf("%I64d\n",Max[t][m]);
    }
    return 0;
}

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 32 6 -1 4 -2 3 -2 3
  
  

 

Sample Output

  
  

   
   68
   
   

    
    

     
     Hint
    
    
Huge input, scanf and dynamic programming is recommended.