题意:
进入迷宫,从(1,1)走到(n,n)
花费2个magic power,可以改变自己的位置
在(i,j)时,有一定几率留在原地,有一定几率到达(i+1,j),有一定几率到达(i,j+1)
问到达(n,n)花费magic power的期望
思路:
e[i][j]= e[i][j]*p1 + e[i+1][j]*p2 + e[i][j+1]*p3+2
e[i][j]= (1/(1-p1))*(e[i+1][j]*p2 + e[i][j+1]*p3+2)
#include<stdio.h>
#include<string.h>
#include<math.h>
/*
e[i][j]= e[i][j]*p1 + e[i+1][j]*p2 + e[i][j+1]*p3+2
e[i][j]= (1/(1-p1))*(e[i+1][j]*p2 + e[i][j+1]*p3+2)
*/
double e[1008][1008];
double p[1008][1008][3];
int main()
{
int r,c;
double a,b;
while(~scanf("%d%d",&r,&c))
{
for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++)
scanf("%lf %lf %lf",&p[i][j][0],&p[i][j][1],&p[i][j][2]);
/* for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++)
printf("%lf %lf %lf %c",p[i][j][0],p[i][j][1],p[i][j][2]," \n"[j==c]);
*/
memset(e,0,sizeof(e));
for(int i=r;i>=1;i--)
for(int j=c;j>=1;j--)
{
if(i==r&&j==c) continue;
if(fabs(1.0-p[i][j][0])<1e-7)
continue;
e[i][j]=(1.0/(1.0-p[i][j][0]))*(p[i][j][1]*e[i][j+1]+p[i][j][2]*e[i+1][j]+2.0);
}
printf("%.3lf\n",e[1][1]);
}
return 0;
}