hdu 5602 Black Jack（dp）

题目链接：hdu 5602 Black Jack

解题思路

dp[i][j]表示闲家为i时，庄家为j时，庄家可以操作的情况下输掉的概率
f[i][j]表示闲家为i，庄家为j，闲家可以继续操作的情况下，胜出的可能
f[i][j]的转移要用到dp[i][j]，对于每个状态来说，取不填牌和填牌后中概率最大的
dp[i][j]等于是闲家不再填牌后，闲家胜的概率

代码

#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;
const int maxn = 105;

bool vis[maxn][maxn];
double dp[maxn][maxn], f[maxn][maxn];

double dfs (int a, int b) {
    if (b > 21) return 0;
    if (a <= b) return 1;

    double ret = 0;
    for (int i = 1; i <= 13; i++) {
        int t = min(i, 10);
        ret += dfs(a, b + t) / 13;
    }
    return ret;
}

int cal(char ch) {
    if (ch == 'A') return 1;
    if (ch == 'T' || ch == 'J' || ch == 'Q' || ch == 'K') return 10;
    return ch - '0';
}

double solve (int a, int b) {
    if (a > 21) return 0;
    if (vis[a][b]) return f[a][b];

    vis[a][b] = true;
    double &ret = f[a][b];
    ret = 0;

    for (int i = 1; i <= 13; i++) {
        int t = min(i, 10);
        ret += solve(a + t, b) / 13;
    }
    return ret = max(ret, dp[a][b]);
}

int main (){
    for (int i = 1; i <= 21; i++) {
        for (int j = 1; j <= 21; j++) {
            dp[i][j] = 1 - dfs(i, j);
        }
    }
    memset(vis, 0, sizeof(vis));

    int cas;
    char s[10];
    scanf("%d", &cas);
    while (cas--) {
        scanf("%s", s);

        int a = cal(s[0]) + cal(s[1]), b = cal(s[2]) + cal(s[3]);
        double pi = solve(a, b);
        printf("%s\n", pi > 0.5 ? "YES" : "NO");
    }
    return 0;
}