思路:这道题跟绿豆蛙的归宿一样,在想题的时候应该把题往有向无环图上面想。假设当前界限是x,出边指向y1, y2…yk。走向不同的出出边的概率分别为p1, p2, …pk。那么节点x的期望值就是:
F
(
x
)
=
∑
i
=
1
k
p
[
i
]
∗
(
F
[
y
i
]
+
1
)
F(x)\, =\, \sum ^{k}_{i=1} {p[i]*(F[{y}_{i}]\, +1)}
F(x)=i=1∑kp[i]∗(F[yi]+1)
由于
∑
i
=
1
k
p
[
i
]
=
1
\, \sum ^{k}_{i=1} {p[i]}\, =\, 1
i=1∑kp[i]=1
所以每次dp的初始值都是1,然后就开始讨论抽不同卡的概率,以及抽到大小王的时候取最小期望值的处理,代码里面都有体现。
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 20;
const int INF = 0x3f3f3f;
double dp[maxn][maxn][maxn][maxn][5][5];
int A,B,C,D;
double solve(int a, int b, int c, int d,int x, int y)
{
auto &v = dp[a][b][c][d][x][y];
if(v>0) return v;
int nowa = a + (x==0) + (y==0);
int nowb = b + (x==1) + (y==1);
int nowc = c + (x==2) + (y==2);
int nowd = d + (x==3) + (y==3);
if(nowa >= A && nowb>= B &&nowc>= C && nowd >=D)
return 0;
int kai = nowa +nowb+nowc +nowd;
int sum = 54-kai;
if(sum<=0) return v = INF;
v = 1; // 初始化为1, 也就是+1 ,因为每次翻开一张牌的
if(a<13)
v+= solve(a+1, b,c,d,x,y)*(13.0-a)/sum;
if(b<13)
v+= solve(a, b+1,c,d,x,y)*(13.0-b)/sum;
if(c<13)
v+= solve(a, b,c+1,d,x,y)*(13.0-c)/sum;
if(d<13)
v+= solve(a, b,c,d+1,x,y)*(13.0-d)/sum;
if(x== 4)
{
double temp = INF;
for(int i = 0;i<=3;i++)
{
temp =min(temp, solve(a,b,c,d,i,y)*(1.0/sum));
}
v+= temp;
}
if(y== 4)
{
double temp = INF;
for(int i = 0;i<=3;i++)
{
temp =min(temp, solve(a,b,c,d,x,i) *(1.0/sum));
}
v+= temp;
}
return v;
}
int main()
{
scanf("%d%d%d%d", &A, &B, &C, &D);
memset(dp, -1, sizeof(dp));
if(max(A-13, 0) + max(B- 13,0) + max(C-13,0) + max(D-13,0) -2 >0)
{
printf("-1.000\n");
}
else
printf("%.3f\n", solve(0, 0,0,0, 4 , 4));
return 0;
}