HDU 3853 LOOPS （概率dp）

题意：给你一个R*C的矩阵，每个格子有三种概率：1.留在改格子中 2.走到右边格子 3.走到下边格子，求从左上角走到最右下角的期望，每一步消耗2个能量；

 

dp[i][j]表示走到（i， j）这格的期望

dp[n][m] = 0;

dp[i][j] = dp[i][j+1] * p2[i][j]  + dp[i+1][j] * p3[i][j] + dp[i][j] * p1[i][j] + 2;

 注意p1[i][j] 等于1时直接continue;

 

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<stdio.h>
#include<algorithm>
#include<cmath>
#include<set>
#include<map>
#include<queue>
using namespace std;


#define inf 0x3f3f3f3f
#define eps 1e-9
#define mod 10007
#define FOR(i,s,t) for(int i = s; i < t; ++i )
#define REP(i,s,t) for( int i = s; i <= t; ++i )
#define LL long long
#define ULL unsigned long long
#define pii pair<int,int>
#define MP make_pair
#define lson id << 1 , l , m
#define rson id << 1 | 1 , m + 1 , r 
#define maxn ( 1000+10 )
#define maxe ( 20000+10 )
#define mxn 20000
	
double dp[maxn][maxn];
double p1[maxn][maxn], p2[maxn][maxn], p3[maxn][maxn];

int main () {
	int n, m;
	while( ~scanf("%d%d", &n, &m ) )  {
		REP( i, 1, n ) {
			REP( j, 1, m ){
				scanf("%lf%lf%lf", &p1[i][j], &p2[i][j], &p3[i][j] );
			}
		}
		memset( dp, 0, sizeof( dp ) );
		for( int i = n; i >= 1; i-- ) {
			for( int j = m; j >= 1; --j ) {
				if( i == n && j ==m ) continue;
				if( 1 - p1[i][j] < eps ) continue;
				dp[i][j] = ( dp[i][j+1] * p2[i][j] + dp[i+1][j] * p3[i][j] + 2 ) / ( 1 - p1[i][j] );
			}
		}
		printf("%.3lf\n", dp[1][1]  );
	}
}