HDU - 1024 Max Sum Plus Plus

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1024

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 S1, S2, S3, S4 … Sx, … Sn (1 ≤ x ≤ n ≤ 1,000,000, -32768 ≤ Sx ≤ 32767). We define a function sum(i, j) = Si + … + Sj (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(i1, j1) + sum(i2, j2) + sum(i3, j3) + … + sum(im, jm) maximal (ix ≤ iy ≤ jx or ix ≤ jy ≤ jx 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(ix, jx)(1 ≤ x ≤ m) instead. ^_

Input
Each test case will begin with two integers m and n, followed by n integers S1, S2, S3 … Sn.
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

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 1000000 + 5;
const int inf = 0x3f3f3f3f;
int m, n, a[maxn], premax[maxn], dp[maxn];
int main(void)
{
	while (scanf("%d%d", &m, &n) == 2)
	{
		memset(premax, 0, sizeof(premax));
		memset(dp, 0, sizeof(dp));
		int temp;
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		for (int i = 1; i <= m; i++)
		{
			temp = -inf;
			for (int j = i; j <= n; j++)
			{
				dp[j] = max(premax[j - 1], dp[j - 1]) + a[j];
				premax[j - 1] = temp;
				temp = max(temp, dp[j]);
			}
		}
		printf("%d\n", temp);
	}
	return 0;
}