题目链接:(oj挂了= =)
题目分析:和上次一样很容易分析得到状态转移方程,从后向前写
题目反思:1.一开始sab了,直接写dp[i][j]=dp[i][j] *d.self+dp[i][j+1]*d.right+dp[i+1][j]*d.down;
原来要移项
2.注意d。self==1时
3.一项一项得除会T的
代码:
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
double dp[1010][1010];
struct gried{
double self,right,down;
} data[1010][1010];
int r,c;
void init()
{
for(int i=1;i<=r;i++)
for(int j=1;j<=c;j++)
{
scanf("%lf %lf %lf",&data[i][j].self,&data[i][j].right,&data[i][j].down);
dp[i][j]=0;
}
}
int main()
{
while(~scanf("%d %d",&r,&c))
{
init();
for(int i=r;i>=1;i--)
for(int j=c;j>=1;j--)
{
if(i==r&&j==c) continue;
gried &d=data[i][j];
if(fabs(1-d.self)<1e-9) continue;
dp[i][j]=(d.right*dp[i][j+1]+d.down*dp[i+1][j]+2)/(1-d.self);
}
printf("%.3lf\n",dp[1][1]);
}
return 0;
}