http://acm.hdu.edu.cn/showproblem.php?pid=4405
题目大意:通过摇筛子,做0跳到n点,有些点可以直接过渡,问要到达n点,需要摇色子的次数的期望值?
Idea:
常规的DP求期望
dp[i]代表从i点要到达N点的期望值;
状态转移方程:
首先dp【N】=0;
其次分两种情况:
(1)i点不可以过渡,dp【i】=sum((dp【i+j】+1)/6)
(2)i点可以过渡到j点,dp【i】=dp[ j ]
#include <cstdio>
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
int main()
{
freopen("test.txt","r",stdin);
static double f[100009];
static int line[100009];
int N,M;
while (scanf("%d%d",&N,&M),N+M)
{
int x,y;
double ans = 0;
memset(line,0,sizeof(line));
for (int i = 1; i <= M; i++)
{
scanf("%d%d",&x,&y);
line[x] = y;
}
int t;
memset(f,0,sizeof(f));
for (int i = N-1; i >= 0; i--)
{
if (line[i])
{
t = i;
while (line[t]) t = line[t];
f[i] = f[t];
continue;
}
f[i] += (f[i+1]+f[i+2]+f[i+3]+f[i+4]+f[i+5]+f[i+6])/6+1;
}
printf("%.4lf\n",f[0]);
}
return 0;
}