题解:
这题确立两个状态 这两个状态都很好想 一个是dp[i]表示已经有i张邮票还需天数的期望,显然dp[n]=0
第二个状态即g[i]表示已经有i张邮票还要花多少钱,显然g[n]=0
然后转移也很好想
对于第一状态会有2种情况 一种是买到了没有的邮票 一种是买到了有的邮票
相应动转移
d
p
[
i
]
=
d
p
[
i
+
1
]
∗
(
n
−
i
)
/
n
+
d
p
[
i
]
∗
i
/
n
+
1
dp[i]=dp[i+1]*(n-i)/n+dp[i]*i/n+1
dp[i]=dp[i+1]∗(n−i)/n+dp[i]∗i/n+1
前两项都好理解 最后一个1其实就是
(
n
−
i
)
/
n
+
i
/
n
(n-i)/n+i/n
(n−i)/n+i/n这样写就更加清楚了
对于第二个状态也会有两种情况 一种是白买了,一种是转移到i+1
对应动转移
g
[
i
]
=
(
g
[
i
]
+
f
[
i
]
+
1
)
∗
i
/
n
+
(
g
[
i
+
1
]
+
f
[
i
+
1
]
+
1
)
∗
(
n
−
i
)
/
n
g[i]=(g[i]+f[i]+1)*i/n+(g[i+1]+f[i+1]+1)*(n-i)/n
g[i]=(g[i]+f[i]+1)∗i/n+(g[i+1]+f[i+1]+1)∗(n−i)/n
代码:
#include <map>
#include <set>
#include <ctime>
#include <cmath>
#include <queue>
#include <stack>
#include <ctime>
#include <string>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
//#include <random>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
#define PB push_back
#define MP make_pair
#define INF 1073741824
#define inf 1152921504606846976
#define pi 3.14159265358979323846
//#pragma comment(linker,"/STACK:10240000,10240000")
//mt19937 rand_(time(0));
const int N=3e5+7,M=2e6;
const long long mod=1e9+7;
inline int read(){int ret=0;char ch=getchar();bool f=1;for(;!isdigit(ch);ch=getchar()) f^=!(ch^'-');for(;isdigit(ch);ch=getchar()) ret=(ret<<1)+(ret<<3)+ch-48;return f?ret:-ret;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}//ÄæÔª
//int head[N],NEXT[M],ver[M],tot;void link(int u,int v){ver[++tot]=v;NEXT[tot]=head[u];head[u]=tot;}
db dp[N],g[N];
int main(){
//freopen("1.txt","r",stdin);
//ios::sync_with_stdio(false);
int n;
scanf("%d",&n);
dp[n]=0;
for(int i=n-1;i>=0;i--){
dp[i]=dp[i+1]+1.0*n/(n-i);
g[i]=1.0*(dp[i]+1)*i/(n-i)+g[i+1]+dp[i+1]+1.0;
}
printf("%.2f\n",g[0]);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}