Codeforces 467C. George and Job (dp)

题目链接：http://codeforces.com/contest/467/problem/C

求k个不重叠长m的连续子序列的最大和。

dp[i][j]表示第i个数的位置个序列的最大和。

前缀和一下就好了。空间可以优化，滚动数组就好了。

//#pragma comment(linker, "/STACK:102400000, 102400000")
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <vector>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
using namespace std;
typedef long long LL;
typedef pair <int, int> P;
const int N = 5e3 + 5;
LL dp[N][2];
LL sum[N];

int main()
{
    int n, m, k;
    scanf("%d %d %d", &n, &m, &k);
    for(int i = 1; i <= n; ++i) {
        scanf("%lld", sum + i);
        sum[i] += sum[i - 1];
    }
    for(int j = 1; j <= k; ++j) {
        for(int i = m*j; i <= n; ++i) {
            dp[i][j%2] = max(dp[i - m][(j - 1)%2] + sum[i] - sum[i - m], dp[i - 1][j%2]);
        }
    }
    printf("%lld
", dp[n][k%2]);
    return 0;
}