HDU1024(DP)

Max Sum Plus Plus

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12589 Accepted Submission(s): 4146

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
Hint
Huge input, scanf and dynamic programming is recommended.

动态规划这种题还是一如既往地毁灭性的难啊。
看了好多博客好不容易感觉有些懂了。

题意：有n个数，要分成m个子段，求这m个字段的和的最大值是多少

题解：$dp[i][j]$，代表现在已经分了i段时，分配完第j个数的情况。
那么不难得出$dp[i][j] = max(dp[i][j-1] + num[j],max（dp[i-1][t] + num[j）])$。
即第j个是和前面一部分连起来的情况和第j个单独作为第i段的情况。这里的t代表从1到j-1的任意数。
但是很显然不论是时间还是空间都是难以接受的。
那接下来需要对方程进行处理。
$dp[i-1][t]$代表的是i-1情况下到j-1的所有情况的最大值，那么我们可以在求$dp[i][t]$时，可以保存$dp[i+1][j]$所需要的$max（dp[i][t] + num[j】）$，用一个ans数组来记录对于当前i来说所需要的$dp[i][t]$。
这里要注意，当计算$dp[i][j]$的时候，可以更新ans[j],但此时ans[j]原值即对于i-1情况下到j的最大值还没有用过，在计算dp[i][j+1]的时候还要用，所以就把这个新的对i情况下到j的最大值保存在ans[n]中，在计算完dp[i][j+1]后再更新ans[j]。
然后就是$dp[i][j-1]$的问题，可以看出$dp[i][j]$的求解只需要$dp[i][j-1]$，与i无关，那么可以用一个变量tmp来记录。

#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn = 1000005;
int n,m;
int num[maxn],dp[maxn],ans[maxn];
int main()
{
    while(~scanf("%d %d",&m,&n))
    {
        memset(num,0,sizeof num);
        for (int i = 1 ; i <= n; i++)
            scanf("%d",&num[i]);
        memset(dp,0,sizeof dp);
        memset(ans,0,sizeof ans);
        for (int i = 1; i <= m; i++)
        {
            int tmp = 0;
            for (int j = 1; j <= i; j++)
                tmp += num[j];
            ans[n] = tmp;
            for (int j = i + 1; j <= n; j++)
            {
                tmp = max(ans[j - 1],tmp) + num[j];
                ans[j - 1] = ans[n];
                ans[n] = max(tmp,ans[n]);
            }
        }
        printf("%d\n",ans[n]);

    }
}