概率/期望DP
文章平均质量分 68
概率/期望DP
西伯利亚松鼠
退役ACMer,退役MOer
展开
-
2021牛客暑期多校训练营5 B - Boxes 期望(线性)
solution 期望题,两种情况: 1.1.1. 花费 CCC ,得知n个箱子中的黑白球个数. 2.2.2. 不花费 CCC,将所有箱子打开. 第二种情况很简单,因此我们展开考虑第一种情况: 假设 f(x)f(x)f(x) 表示开启 xxx 个箱子时完成要求,所需的费用. f(0)=0.f(0)=0.f(0)=0. 先将箱子进行排序,优先开启费用小的箱子,对于黑球,可能有 0,1,2,..,n0,1,2,..,n0,1,2,..,n 个,因此我们开启第一个箱子的时候,花费 w1w_1w1,如果此时游戏.原创 2021-07-31 19:48:42 · 193 阅读 · 0 评论 -
毕业生的序列游戏 期望DP
毕业生的序列游戏 solution dp[i][j]表示i个a,j个ab的概率,添加a的概率为p,添加b的概率为qdp[i][j]表示i个a,j个ab的概率,添加a的概率为p,添加b的概率为qdp[i][j]表示i个a,j个ab的概率,添加a的概率为p,添加b的概率为q if i+j<k(如果放b,ab个数+i,即加上先前a的个数):if~i+j<k(如果放b,ab个数+i,即加上先前a的个数):if i+j<k(如果放b,ab个数+i,即加上先前a的个数): dp[原创 2021-07-15 10:10:42 · 116 阅读 · 0 评论 -
Alice和Bob赌糖果 牛客 概率DP(赌徒破产模型)
Alice和Bob赌糖果 solution f0=0,fn+m=1f_0=0,f_{n+m}=1f0=0,fn+m=1 fi=(1−p)fi−1+pfi+1f_i=(1-p)f_{i-1}+pf_{i+1}fi=(1−p)fi−1+pfi+1 =>fi+1−fi=fi−fi−1=>f_{i+1}-f_i=f_i-f_{i-1}=>fi+1−fi=fi−fi−1 令fi=gifi+1=>ki=p1−(1−p)ki−1令f_i=g_if_{i+1}=>k_i=\原创 2021-07-14 18:55:37 · 297 阅读 · 0 评论 -
Everything Is Generated In Equal Probability HDU-6595 期望DP
Everything Is Generated In Equal Probability Solution dp[n]=E+∑i=0n−1Cnidp[i]+dp[n]2ndp[n]=E+\frac{\sum\limits_{i=0}^{n-1}C_n^idp[i]+dp[n]}{2^n}dp[n]=E+2ni=0∑n−1Cnidp[i]+dp[n] E=n(n−1)4E=\frac{n(n-1)}{4}E=4n(n−1) dp[n]=n(n−1)4+∑i=0n−1Cnidp[i]2n1−12ndp原创 2021-05-01 22:51:21 · 740 阅读 · 0 评论 -
Back to the Past ZOJ-3582 期望DP
Back to the Past solution Cnm=Cn−1m−1+Cn−1mC_n^m=C_{n-1}^{m-1}+C_{n-1}^{m}Cnm=Cn−1m−1+Cn−1m dp[i][j]=∑u=0i+u≤n∑v=0j+v≤ndp[i+u][j+v]Ci+uupuqiCj+vvpvqj+dp[i][j]Ci0qiCj0qj+1dp[i][j]=\sum\limits_{u=0}^{i+u≤n}\sum\limits_{v=0}^{j+v≤n}dp[i+u][j+v]C_{i+u}^up^原创 2021-04-12 19:14:01 · 61 阅读 · 0 评论 -
Tight Words ZOJ-1883 概率DP
Tight Words solution dp[i+1][j]=dp[i][j]+dp[i][j+1]+dp[i][j−1]dp[i+1][j]=dp[i][j]+dp[i][j+1]+dp[i][j-1]dp[i+1][j]=dp[i][j]+dp[i][j+1]+dp[i][j−1] answer=∑i=0kdp[n][i](k+1)nanswer=\frac{\sum\limits_{i=0}^{k}dp[n][i]}{(k+1)^n}answer=(k+1)ni=0∑kdp[n][i] cod原创 2021-04-12 15:27:34 · 785 阅读 · 0 评论 -
One Person Game ZOJ-3329 期望DP
One Person Game solution dp[i]=∑k=1k1+k2+k3dp[i+k]p[k]+dp[0]p[0]+1dp[i]=\sum\limits_{k=1}^{k1+k2+k3}dp[i+k]p[k]+dp[0]p[0]+1dp[i]=k=1∑k1+k2+k3dp[i+k]p[k]+dp[0]p[0]+1 设dp[i]=A[i]dp[0]+B[i]dp[i]=A[i]dp[0]+B[i]dp[i]=A[i]dp[0]+B[i] dp[i]=∑k=1k1+k2+k3(A[i+k]dp原创 2021-04-11 23:28:35 · 796 阅读 · 0 评论 -
Bloodsucker ZOJ-3551 期望DP
Bloodsucker solution dp[i+1]=(dp[i]+1)∗i∗(n−i)pCn2+(dp[i+1]+1)∗(i(n−i)(1−p)Cn2+1−i(n−i)Cn2)dp[i+1]=(dp[i]+1)*\frac{i*(n-i)p}{C_n^2}+(dp[i+1]+1)*(\frac{i(n-i)(1-p)}{C_n^2}+1-\frac{i(n-i)}{C_n^2})dp[i+1]=(dp[i]+1)∗Cn2i∗(n−i)p+(dp[i+1]+1)∗(Cn2i(n−i)(1−p)原创 2021-04-11 21:06:41 · 750 阅读 · 0 评论 -
Rating HDU-4870 概率DP
HDU-4870 solution 先发明天再写 code /*Siberian Squirrel*/ /*Cute JinFish*/ #include<bits/stdc++.h> using namespace std; double p; double dp[30]; void solve(double res = 0) { dp[0] = 1 / p; dp[1] = dp[0] / p; res = dp[0] + dp[1]; for(int原创 2021-03-29 23:28:26 · 722 阅读 · 0 评论 -
2013 ACM-ICPC吉林通化全国邀请赛 J-Dice 概率DP + 数列
HDU-4599 solution 已知 dpi[n]=0,(i=1,2)已知~dp_i[n]=0,(i=1,2)已知 dpi[n]=0,(i=1,2) dp1[i]=dp1[i+1]∗56+dp1[1]∗16+1dp_1[i]=dp_1[i+1]*\frac56+dp_1[1]*\frac16+1dp1[i]=dp1[i+1]∗65+dp1[1]∗61+1 =>dp1[n]−(dp1[1]+56)=6[dp1[n−1]−(dp1[1]+56)],dp1[0]=dp1原创 2021-03-29 15:48:54 · 715 阅读 · 0 评论 -
2013 Asia Regional Changchun C-Little Tiger vs. Deep Monke 概率DP
HDU-4815 solution dp[i][j]=dp[i][j]+dp[i−1][j]∗12dp[i][j] = dp[i][j] + dp[i-1][j]*\frac{1}{2}dp[i][j]=dp[i][j]+dp[i−1][j]∗21 dp[i][j]=dp[i][j]+dp[i−1][j−v[i]]∗12dp[i][j]=dp[i][j]+dp[i-1][j-v[i]]*\frac12dp[i][j]=dp[i][j]+dp[i−1][j−v[i]]∗21 eps=1e−8eps=1e原创 2021-03-29 14:26:10 · 751 阅读 · 0 评论 -
Balls 牛客 期望DP
Balls solutio dp[i]=dp[i−1]i+1+dp[i−1]dp[i] = \frac{dp[i-1]}{i+1}+dp[i-1]dp[i]=i+1dp[i−1]+dp[i−1] code /*Siberian Squirrel*/ /*Cute KiloFish*/ #include<bits/stdc++.h> #define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) #define ACM_LOCAL原创 2021-03-14 21:20:18 · 772 阅读 · 0 评论 -
LOOPS HDU-3853 期望DP
LOOPS code /*Siberian Squirrel*/ /*Cute KiloFish*/ #include<bits/stdc++.h> #define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) #define ACM_LOCAL using namespace std; typedef long long ll; const double PI = acos(-1); const double eps = 1原创 2021-03-14 21:20:05 · 712 阅读 · 0 评论 -
Aeroplane chess HDU-4405 期望DP
Aeroplane chess code /*Siberian Squirrel*/ /*Cute KiloFish*/ #include<bits/stdc++.h> #define IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0) #define ACM_LOCAL using namespace std; typedef long long ll; const double PI = acos(-1); const doub原创 2021-03-14 21:19:43 · 1213 阅读 · 0 评论