HDU1024 Max Sum Plus Plus

解题思路：这题有一定难度，请参考http://www.cnblogs.com/kuangbin/archive/2011/08/04/2127085.html

见代码：

#include<cstdio>
#include<algorithm>
using namespace std;
#define inf 0x3f3f3f3f
const int maxn = 100005;
int A[maxn], dp[maxn], max1[maxn];
int main()
{
    int n, m, MAX;
    while(~scanf("%d %d", &m, &n))
    {
        for(int i = 1; i <= n; i++)
        {
            scanf("%d", &A[i]);
            dp[i] = 0;
            max1[i] = 0;
        }
        dp[0] = 0;
        max1[0] = 0;
        for(int i = 1; i <= m; i++)
        {
            MAX = -inf;
            for(int j = i; j <= n; j++)
            {
                dp[j] = max(dp[j-1]+A[j], max1[j-1]+A[j]);
                max1[j-1] = MAX;
                MAX = max(MAX, dp[j]);
            }
        }
        printf("%d\n", MAX);
    }
    return 0;
}