A - Max Sum Plus Plus

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\le x\le n\le 1,000,000,-32768\le S_x\le 32767)$. We define a function $sum(i,j)=S_i+...+S_j(1\le i\le j\le 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\le i_y\le j_{x}or{i}_x\le j_y\le 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\le x\le 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

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[i][j]表示前j个数分成i组时的最大值
转移方程为dp[i][j] = max(dp[i][j-1] + arr[j], max(dp[i-1][k]) + arr[j]) (0 < k < j)
因为n最大是1e6，所以只能用一维来存储，类似于背包的一维优化。

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f;

int arr[N];
int dp[N];
int ma[N];//当前最大的

int main(void)
{
	int m, n, ans;
	while (scanf("%d%d", &m, &n) != EOF)
	{
		for (int i = 1; i <= n; i++)
			scanf("%d", &arr[i]);
		memset(dp, 0, sizeof(dp));//0个数的全是0
        memset(ma, 0, sizeof(ma));//分成0组的全是0
        for (int i = 1; i <= m; i++)//分成的组数
		{
            ans = -INF;
            for (int j = i; j <= n; j++)//数字个数
			{
				//第j个数分入前一组，第j个数单独成为一组
                dp[j] = max(dp[j-1] + arr[j], ma[j-1] + arr[j]);
                ma[j-1] = ans;
                ans = max(ans, dp[j]);
            }
        }
        printf("%d\n", ans);
	}
	return 0;
}

题解链接：https://blog.csdn.net/codeswarrior/article/details/80310401