[BZOJ 1426]收集邮票：期望DP

点击这里查看原题

挺神奇的一道题，我自己没完全看懂题解，还是放别人的链接吧。这里

/*
User:Small
Language:C++
Problem No.:1426
*/
#include<bits/stdc++.h>
#define ll long long
#define inf 999999999
using namespace std;
double f[10005],g[10005];
int n;
int main(){
    freopen("data.in","r",stdin);//
    scanf("%d",&n);
    for(int i=n-1;i>=0;i--) g[i]=g[i+1]+1.0*n/(n-i);
    for(int i=n-1;i>=0;i--) f[i]=f[i+1]+g[i+1]+g[i]*i/(n-i)+1.0*n/(n-i);
    printf("%.2lf\n",f[0]);
    return 0;
}