POJ2096（概率dp）

Description
Ivan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he classifies all possible bugs into n categories. Each day he discovers exactly one bug in the program and adds information about it and its category into a spreadsheet. When he finds bugs in all bug categories, he calls the program disgusting, publishes this spreadsheet on his home page, and forgets completely about the program.
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program. They hire Ivan to prove that the program in question is disgusting. However, Ivan has a complicated problem. This new program has s subcomponents, and finding bugs of all types in each subcomponent would take too long before the target could be reached. So Ivan and Microhard agreed to use a simpler criteria — Ivan should find at least one bug in each subsystem and at least one bug of each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. It’s important because the company releases a new version soon, so it can correct its plans and release it quicker. Nobody would be interested in Ivan’s opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. Similarly, the bug can be found in any given subsystem with equal probability. Any particular bug cannot belong to two different categories or happen simultaneously in two different subsystems. The number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan’s work) required to name the program disgusting.
Input
Input file contains two integer numbers, n and s (0 < n, s <= 1 000).
Output
Output the expectation of the Ivan’s working days needed to call the program disgusting, accurate to 4 digits after the decimal point.
Sample Input
1 2
Sample Output
3.0000

题意：有一个爱收集程序bug的人，他每天能发现一个bug。给你一个程序，有n类bug，s个子程序，问你能至少在每一类中发现一个bug，至少在每一个子程序中发现一个bug的天数的期望。

题解：dp[i][j]表示现在还有i类个bug，j个系统中的bug没有被发现过时候的天数期望。dp[n][s] = 0。现在要求d[0][0]。其中状态转移方程是：
dp[i][j] = (i * (s - j) * dp[i][j + 1] + (n - i) * j * dp[i + 1][j] + (n - i) * (s - j) * dp[i + 1][j + 1] + n * s) / (n * s - i * j);
dp[i][j]可以从4个方向转移过来，一个是本天发现的bug是以前已经发现过的类和子程序中的；一个是本天发现的bug是以前已经发现过的类中的，但不是以前发现的子程序中的；一个是本天发现的bug是以前发现过的子程序中的，但不是以前发现的类中的；最后一个是本天发现的bug是从未发现过bug的类和子程序中的。四个转移方向的概率不同，把四个方向转移过来的期望求出来再加一就得到了结果。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <map>
#include <queue>
#include <cmath>
#include <vector>
#include <functional>

using namespace std;
const int maxn = 1000 + 5;
double dp[maxn][maxn];

int main()
{
    #ifndef ONLINE_JUDGE
    freopen ("in.txt", "r", stdin);
    #endif // ONLINE_JUDGE
    int n, s;
    scanf ("%d%d", &n, &s);
    memset (dp, 0, sizeof(dp));
    for (int i = n; i >= 0; i--) {
        for (int j = s; j >= 0; j--) {
            if (i == n && j == s) continue;//这句别忘，dp[n][s]没有上一个状态
            dp[i][j] = (i * (s - j) * dp[i][j + 1] + (n - i) * j * dp[i + 1][j] + (n - i) * (s - j) * dp[i + 1][j + 1] + n * s) / (n * s - i * j);
            //printf ("%lf\n", dp[i][j]);
        }
    }
    printf ("%.4f\n", dp[0][0]);
    return 0;
}