HDU 1024 Max Sum Plus Plus

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

其实这个dp还不是很明白

dp[i][j]=Max(dp[i][j-1]+a[j] , max( dp[i-1][k] ) + a[j] ) 0<k<j

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

const int MAX = 1000010;
const int INF = 0x3f3f3f3f;
int dp[MAX],pre[MAX],a[MAX];
int main(){
//    freopen("in.txt", "r", stdin);
    int m,n;
    while(scanf("%d%d",&m,&n) == 2){
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        memset(dp, 0, sizeof(dp));
        memset(pre, 0, sizeof(pre));
        int tmp;
        for(int i=1; i<=m; i++){
            tmp = -INF;
            for(int j=i; j<=n; j++){///非独立成组和独立成组转移而来
                dp[j] = max(dp[j-1] + a[j], pre[j-1] + a[j]);
                pre[j-1] = tmp;
                tmp = max(tmp, dp[j]);
            }
        }
        printf("%d\n",tmp);
    }
    return 0;
}