USACO 2008 Running(贝茜的晨练)

【题解】

        动态规划，dp[i][j]表示第i分钟疲劳度为j的最长距离。

【代码】

#include <iostream>
#include <cstdlib>
#include <algorithm>
#include <cstring>
using namespace std;
#define scan(x) cin >> x
#define print(x) printf("%d
", x)
#define maxn 10005
#define maxm 505

int D[maxn], dp[maxn][maxm];

int main()
{
    int N, M;
    scan(N);
    scan(M);
    for (int i = 1; i <= N; i++) scan(D[i]);
    for (int i = 1; i <= N; i++) {
        dp[i][0] = dp[i - 1][0];
        for (int j = 1; j <= i && j <= M; j++) {
            dp[i][0] = max(dp[i][0], dp[i - j][j]); // If spent the preceding j minutes resting
            dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] + D[i]); // Run when fatigue degree is j.
        }
    }
    print(dp[N][0]);
    //system("pause");
    return 0;
}