POJ 2096 (概率dp）

最新推荐文章于 2020-08-30 18:14:33 发布

zytjyh

最新推荐文章于 2020-08-30 18:14:33 发布

阅读量298

点赞数 1

分类专栏： ACM_POJ 文章标签： poj dp 动态规划概率dp

本文链接：https://blog.csdn.net/JACK_JYH/article/details/52230769

版权

ACM_POJ 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>

using namespace std;
const int INF = 0x3f3f3f3f;
const int MAXN = 1010;
double dp[MAXN][MAXN];

int main()
{
    int n, s;
    while (scanf("%d%d", &n, &s) != EOF)
    {
        memset(dp, 0, sizeof(dp));
        dp[n][s] = 0;
        double p1, p2, p3, p4;
        for (int i = n; i >= 0; i--)
        {
            for (int j = s; j >= 0; j--)
            {
                if (i == n&&j == s)
                    continue;
                p1 =(double)(n - i)*j / n/s;
                p2 = (double)i*(s - j) / n / s;
                p3 = (double)(n - i)*(s - j) / n / s;
                p4 = (double)i*j / n / s;
                dp[i][j] = (p1*dp[i + 1][j] + p2*dp[i][j + 1] + p3*dp[i + 1][j + 1] + 1)/ (1 - p4);
            }
        }
        printf("%.4f\n", dp[0][0]);
    }
    return 0;
}