洛谷P1541 乌龟棋

原题传送门

一道比较简单易懂的线性DP题：

设状态dp[a][b][c][d]表示使用数量分别为a, b, c, d张的不同的牌

num数组存储每一个位置的分值

r = a + b * 2 + c * 3 + d * 4 + 1，表示当前的位置

则有 if(a)
( dp [ a ] [ b ] [ c ] [ d ] = max ( dp [ a - 1] [ b ] [ c ] [ d ] + num [ r ] , dp [ a ] [ b ] [ c ] [ d] )

因为可以直接获得初始位置的分数，所以边界条件为 dp [ 0 ] [ 0 ] [ 0 ] [ 0 ] = num [ 1 ]

得到状态转移方程后，本题就解决了

#include <bits/stdc++.h>
int n, m, tot;
int num[410], g[5];
int dp[40][40][40][40];
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++)
        num[i] = read();
    for (int i = 1; i <= m; i++)
        tot = read(), g[tot]++;
    dp[0][0][0][0] = num[1];
    for (int a = 0; a <= g[1]; a++)
        for (int b = 0; b <= g[2]; b++)
            for (int c = 0; c <= g[3]; c++)
                for (int d = 0; d <= g[4]; d++)
                {
                    int r = a + b * 2 + c * 3 + d * 4 + 1;
                    if (a)
                        dp[a][b][c][d] = std::max(dp[a - 1][b][c][d] + num[r], dp[a][b][c][d]);
                    if (b)
                        dp[a][b][c][d] = std::max(dp[a][b - 1][c][d] + num[r], dp[a][b][c][d]);
                    if (c)
                        dp[a][b][c][d] = std::max(dp[a][b][c - 1][d] + num[r], dp[a][b][c][d]);
                    if (d)
                        dp[a][b][c][d] = std::max(dp[a][b][c][d - 1] + num[r], dp[a][b][c][d]);
                }
    std::cout << dp[g[1]][g[2]][g[3]][g[4]] << std::endl;
    return 0;
}

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