Back to the Past ZOJ-3582 期望DP

最新推荐文章于 2021-07-31 19:48:42 发布

西伯利亚松鼠

最新推荐文章于 2021-07-31 19:48:42 发布

阅读量79

点赞数

分类专栏： # 概率/期望DP

本文链接：https://blog.csdn.net/qq_46173805/article/details/115634686

版权

动态规划组合数学概率计算递推关系算法实现

关键词由CSDN通过智能技术生成

概率/期望DP 专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Back to the Past

在这里插入图片描述

solution

$C_n^m=C_{n-1}^{m-1}+C_{n-1}^{m}$

$dp[i][j]=\sum\limits_{u=0}^{i+u≤n}\sum\limits_{v=0}^{j+v≤n}dp[i+u][j+v]C_{i+u}^up^uq^iC_{j+v}^vp^vq^j+dp[i][j]C_{i}^0q^iC_j^0q^j+1$

$P[n][m]=C_n^mp^mq^{n-m}$

$C_{n-1}^{m-1}p^mq^{n-m}+C_{n-1}^{m}p^mq^{n-m}$

$C_{n-1}^{m-1}p^{m-1}q^{n-m}*p+C_{n-1}^{m}p^{m}q^{n-m-1}*q$

$= P [n - 1] [m - 1] * p + P [n - 1] [m] * q$

$dp[i][j]=\sum\limits_{u=0}^{i+u≤n}\sum\limits_{v=0}^{j+v≤n}dp[i+u][j+v]*P[i+u][u]*P[j+v][v]+dp[i][j]*P[i][0]*P[j][0]+1$

$dp[i][j]=\frac{\sum\limits_{u=0}^{i+u≤n}\sum\limits_{v=0}^{j+v≤n}dp[i+u][j+v]*P[i+u][u]*P[j+v][v]+1}{1-P[i][0]*P[j][0]}$

code

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int n, m;
double p, q;
double dp[110][110];
double P[110][110];

void solve() {
    while (cin >> n >> m >> p) {
        q = 1.0 - p;
        double _p = 1, _q = 1;
        if (n + m + (int) p == 0) return;
        memset(dp, 0, sizeof dp);

        P[0][0] = 1;
        P[1][0] = q, P[1][1] = p;
        for (int i = 2; i <= n; ++i) {
            P[i][0] = P[i - 1][0] * q;
            P[i][i] = P[i - 1][i - 1] * p;
            for (int j = 1; j < i; ++j) {
                P[i][j] = P[i - 1][j] * q + P[i - 1][j - 1] * p;
            }
        }

        for (int i = n; i >= 0; --i) {
            for (int j = n; j >= 0; --j) {
                double ans = 0;
                if (i < m || j < m) {
                    for (int u = 0; i + u <= n; ++u) {
                        for (int v = 0; j + v <= n; ++v) {
                            ans += dp[i + u][j + v] * P[n - i][u] * P[n - j][v];
                        }
                    }
                    dp[i][j] = (ans + 1.0) / (1 - P[n - i][0] * P[n - j][0]);
                }
            }
        }
        cout << fixed << setprecision(6) << dp[0][0] << endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
    signed test_index_for_debug = 1;
    char acm_local_for_debug = 0;
    do {
        if (acm_local_for_debug == '$') exit(0);
        if (test_index_for_debug > 20)
            throw runtime_error("Check the stdin!!!");
        auto start_clock_for_debug = clock();
        solve();
        auto end_clock_for_debug = clock();
        cout << "Test " << test_index_for_debug << " successful" << endl;
        cerr << "Test " << test_index_for_debug++ << " Run Time: "
             << double(end_clock_for_debug - start_clock_for_debug) / CLOCKS_PER_SEC << "s" << endl;
        cout << "--------------------------------------------------" << endl;
    } while (cin >> acm_local_for_debug && cin.putback(acm_local_for_debug));
#else
    solve();
#endif
    return 0;
}