hdu1024(最大m子段和）

题目链接

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const ll INF = 35000;
int a[maxn];
int n, m;
ll dp[2][maxn];


int main()
{
    while(scanf("%d", &m) != EOF)
    {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)
            scanf("%d", &a[i]);

        for(int i = 0; i <= n; i++)        //多组样例，务必清空！
            dp[0][i] = 0;

        int k = 1;
        for(int i = 1; i <= m; i++, k ^= 1)
        {
            ll maxx = -maxn * INF;
            dp[k][i - 1] = -maxn * INF;
            for(int j = i; j <= n; j++)
            {
                //初始化和题目要求有关
                dp[k][j] = -maxn * INF;                     //WA: dp[k][j] = 0不对，因为此题必须选，而和有可能无穷小，所以不像之前的题dp[k][j]默认为0就可以
                dp[k][j] = max(dp[k][j - 1] + a[j], dp[k][j]);
                maxx = max(maxx, dp[k^1][j - 1]);
                dp[k][j] = max(maxx + a[j], dp[k][j]);
            }
        }
        ll ans = -maxn * INF;
        for(int i = m; i <= n; i++)
        {
            ans = max(dp[m&1][i], ans);
        }
        printf("%I64d\n", ans);
    }
    return 0;
}