hdu1024 Max Sum Plus Plus

http://acm.hdu.edu.cn/showproblem.php?pid=1024

DP

最大m个不重叠连续子段和

#include <stdio.h>

#define N 1000100

int a[N], dp1[N], dp2[N];

int max(int x, int y)
{
    return x>y? x: y;
}

int main()
{
    int i, j, n, m;
    while(~scanf("%d%d", &m, &n))
    {
        for(i=1; i<=n; i++)
        {
            scanf("%d", a+i);
            dp2[i] = 0;
        }
        dp2[0] = 0;
        for(i=1; i<=m; i++)
        {
            dp1[i] = dp2[i-1] + a[i];
            for(j=i+1; j<=n; j++)
            {
                dp1[j] = max(dp2[j-1], dp1[j-1]) + a[j];
            }
            dp2[i] = dp1[i];
            for(j=i+1; j<=n; j++)
            {
                dp2[j] = max(dp2[j-1], dp1[j]);
            }
        }
        printf("%d\n", dp2[n]);
    }
    return 0;
}