Alice和Bob赌糖果 牛客 概率DP（赌徒破产模型）

Alice和Bob赌糖果

solution

$f_0=0,f_{n+m}=1$

$f_i=(1-p)f_{i-1}+p{f}_{i+1}$

$=>f_{i+1}-f_i=f_i-f_{i-1}$

$令f_i=g_i{f}_{i+1}=>g_i=\frac{p}{1-(1-p)g_{i-1}}$

$=>f_n=\prod _{i=m}^{n+m-1}{g}_i$

code

#include <bits/stdc++.h>
using namespace std;
#define double long double
int main() {
    int n, l, r; cin >> n >> l >> r;
    int m, L, R; cin >> m >> L >> R;
    if(m == 0) cout << "1.00000" << '\n';
    else if(n == 0) cout << "0.00000" << '\n';
    else {
        double ali = 0, bob = 0;
        for(int i = l; i <= r; ++ i) {
            for(int j = L; j <= R; ++ j) {
                if(i > j) ali ++;
                if(i < j) bob ++;
            }
        }
        if(ali == 0) cout << "0.00000" << '\n';
        else {
            double p = ali / (ali + bob);
            double q = 1.0 - p;
            vector<double> g(n + m + 1);
            for(int i = 1; i < n + m; ++ i) {
                g[i] = p / (1.0 - q * g[i - 1]);
            }
            double res = 1.0;
            for(int i = n; i < n + m; ++ i) res *= g[i];
            cout << fixed << setprecision(5) << res << '\n';
        }
    }
    return 0;
}