[洛谷 P1353] 跑步

一道线性DP的简单题

原题传送门

设f [ i ] [ j ] 表示第i分钟疲劳度为j时的最大跑步距离

状态转移方程式为：

• 跑步的情况：

f [ i + 1 ] [ j + 1 ] = max(f [ i + 1 ] [ j + 1 ] , f [ i ][ j ] + dis [ i + 1]);

• 休息的情况

  • 若j=0
    则有 f [ i ] [ 0 ] = max{f [ i - 1] [ 0 ] , f[ i ] [ 0 ] }

  • else
    f [ i + j ] [ 0 ] = max { f [ i + j ] [ 0 ], f [ i ] [ j ] + dis[i+j]; }

#include <bits/stdc++.h>

const int maxn = 100010;
const int maxm = 510;

int n, m;
int a[maxn], f[maxn][maxm];

inline int read()
{
    int x = 0, f = 1;
    char ch = getchar();
    while (!isdigit(ch))
        f = (ch == '-') ? -1 : 1, ch = getchar();
    while (isdigit(ch))
        x = x * 10 + (ch - '0'), ch = getchar();
    return x * f;
}

int main()
{
    n = read(), m = read();
    for (int i = 1; i <= n; i++)
        a[i] = read();
    f[1][1] = a[1];
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= std::min(i, m); j++)
        {
            if (j == 0)
                f[i][0] = std::max(f[i - 1][0], f[i][0]);
            else
                f[i + j][0] = std::max(f[i + j][0], f[i][j]);
            f[i + 1][j + 1] = std::max(f[i + 1][j + 1], f[i][j] + a[i + 1]);
        }
    std::cout << f[n][0] << std::endl;
    return 0;
}

转载于:https://www.cnblogs.com/wyctstf/p/11372540.html