hdu4405 概率dp

Description

Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal probability to face up and the numbers on the faces are 1,2,3,4,5,6). When Hzz is at grid i and the dice number is x, he will moves to grid i+x. Hzz finishes the game when i+x is equal to or greater than N. 

There are also M flight lines on the chess map. The i-th flight line can help Hzz fly from grid Xi to Yi (0<Xi<Yi<=N) without throwing the dice. If there is another flight line from Yi, Hzz can take the flight line continuously. It is granted that there is no two or more flight lines start from the same grid. 

Please help Hzz calculate the expected dice throwing times to finish the game. 

 

Input

There are multiple test cases. 
Each test case contains several lines. 
The first line contains two integers N(1≤N≤100000) and M(0≤M≤1000). 
Then M lines follow, each line contains two integers Xi,Yi(1≤Xi<Yi≤N).   
The input end with N=0, M=0. 

 

Output

For each test case in the input, you should output a line indicating the expected dice throwing times. Output should be rounded to 4 digits after decimal point. 

题意就是说在起点掷骰子，几个点就走几步，然后有几个地方是跳跃点，可以从这个地方跳到更远的地方，求从起点到终点掷骰子次数的期望

肯定是概率dp了，处理一下跳跃点，从后向前逆推即可

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<iostream>
using namespace std;
typedef long long ll;
double dp[100005];
int port[100005];
int n,m;
void init()
{
	for(int i=0;i<n;i++)
	{
		dp[i]=0.0;
	}
}
int main()
{

	while(scanf("%d %d",&n,&m)!=EOF&&(m+n))
	{
		memset(port,-1,sizeof(port));
		init();
		for(int i=0;i<m;i++)
		{
			int x,y;
			scanf("%d %d",&x,&y);
			port[x]=y;
		}
		dp[n]=0.0;
		for(int i=n-1;i>=0;i--)
		{
			if(port[i]!=-1)
				dp[i]=dp[port[i]];
			else
			{
			for(int j=1;j<=6;j++)
			{
				if(i+j >= n )
					break;
				dp[i]+=1.0 / 6.0 * dp[i+j];
			}
			dp[i]+=1.0;
			}
		}
		printf("%.4f\n",dp[0]);
	}
	return 0;
}