http://acm.hdu.edu.cn/showproblem.php?pid=4405
第2道概率期望dp,状态转移很好想,入门题目。
/*
hdu 4405 期望DP
仍然是倒着递推
题意:
飞行棋,从1-n,每次走的步数掷筛子决定,问到达终点走的总步数的期望
求解:
dp[i]表示已经到位置i最终到达终点的期望
dp[i] = sigma ((1/6.0) * dp[i+k] ) + 1,k = 1,2,3,4,5,6
如果遇到飞行的情况,dp[i] = dp[j]
map离散化一下可以,状态转移方程好想
*/
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<vector>
#include<set>
#include<map>
#include<algorithm>
#include<sstream>
#define eps 1e-9
#define pi acos(-1)
#define long long ll
#define M 10
#define N 1010
using namespace std;
const int _max = 1e5 + 10;
int n,m,u,v;
double dp[_max];
map<int,int>mp;
int main()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
#endif // ONLINE_JUDGE
while(scanf("%d%d",&n,&m)==2&&n+m){
mp.clear();
for(int i = 0; i < m; ++ i){
scanf("%d%d",&u,&v);
mp[u] = v;
}
dp[n] = 0;//dp[i]表示已经到达位置i,再到最终目标的期望;最终求解dp[0]
memset(dp,0,sizeof(dp));
for(int i = n-1; i >= 0;i -- ){
if(!mp[i]){
for(int j = 1; j <= 6; ++ j)
dp[i]+=dp[(i+j>n)?n:i+j]/6.0;
dp[i]+=1;
}
else dp[i] = dp[mp[i]];
}
printf("%.4f\n",dp[0]);
}
return 0;
}