Max Sum Plus Plus(dp)

Problem:Max Sum Plus Plus

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 1, S 2, S 3, S 4 … 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 1, j 1) + sum(i 2, j 2) + sum(i 3, j 3) + … + 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 1, S 2, S 3 … S n.
Process to the end of file.

Output:
Output the maximal summation described above in one line.

Sample Input:

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

Sample Output:

6
8

Note:
Huge input, scanf and dynamic programming is recommended.

Language:C++

#include <iostream>
#include <cstring>

using namespace std;

const int N=1e6+10;

int m,n;
int a[N],pre_max[N];

void dp()
{
  for(int i=1;i<=m;i++)
  {
    int temp=0;
    for(int k=1;k<=i;k++)  temp+=a[k];
    pre_max[n]=temp;

    for(int j=i+1;j<=n;j++)
    {
        temp=max(pre_max[j-1]+a[j],temp+a[j]);
        pre_max[j-1]=pre_max[n];
        pre_max[n]=max(pre_max[n],temp);
    }    
  }
}

int main()
{
  while(cin>>m>>n)
  {
    for(int i=1;i<=n;i++)  cin>>a[i];

    memset(pre_max,0,sizeof(pre_max));

    dp();
    cout<<pre_max[n]<<endl;
  }
 return 0;
}