原题:http://acm.hdu.edu.cn/showproblem.php?pid=3853
题意:
有一个r行c列的格子,起点(1,1),终点(r,c);
每次都有三种选择,不走,向右走,向下走,每走一步消耗两点魔法值,分别给出三种选择的概率;
问走完迷宫所消耗魔法值的期望;
思路:
dp[i][j]表示走到(i,j)所消耗魔法值的期望,dp[r][c] = 0;
所以动态方程为dp[i][j] = dp[i][j]*p1+(dp[i][j+1]*p2+dp[i+1][j]*p3+2),2表示本次走一步所消耗魔法值;
#include<stdio.h>
#include<string.h>
int r, c;
double dp[1005][1005];
struct node
{
double no, right, down;
}w[1005][1005];
int main()
{
while(scanf("%d%d", &r, &c)!=EOF)
{
memset(dp, 0, sizeof(dp));
for(int i = 1;i<=r;i++)
for(int j = 1;j<=c;j++)
scanf("%lf%lf%lf", &w[i][j].no, &w[i][j].right, &w[i][j].down);
for(int i = r;i>=1;i--)
{
for(int j = c;j>=1;j--)
{
if((i == r && j == c) || w[i][j].no == 1)
continue;
dp[i][j] = (dp[i][j+1]*w[i][j].right+dp[i+1][j]*w[i][j].down+2)/(1-w[i][j].no);
}
}
printf("%.3f\n", dp[1][1]);
}
return 0;
}