A - Max Sum Plus Plus

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=68966#problem/A

A - Max Sum Plus Plus

Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  HDU 1024

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. 

果然还是dp too low

#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int SIZE=1e6+10;
const int maxn=1<<30;
int dp[SIZE],pre[SIZE],a[SIZE];
int main(){
	int n,m,Max;
	while(scanf("%d%d",&m,&n)!=EOF){
		for(int i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		memset(dp,0,sizeof(dp));
		memset(pre,0,sizeof(pre));
		for(int i=1;i<=m;i++){
			Max=-maxn;
			for(int j=i;j<=n;j++){
				dp[j]=max(dp[j-1],pre[j-1])+a[j];//dp存当前行的最大值
				pre[j-1]=Max;//这一行的max{dp[i]-dp[j]},到下一行变成了max{dp[i-1]-dp[j-1]};
				Max=max(dp[j],Max);//max存在当前行下得到的i-j号中最大的dp
			}
		}
		printf("%d\n",Max);
	}
	return 0;
}