HDU 4405 Aeroplane chess——期望dp

HDU 4405 Aeroplane chess——期望dp

水题

#include #include #include #include using namespace std;const int maxn = 1e5 + 20;double dp[maxn];int fly[maxn];int to(int x) { while (fly[x]) x = fly[x]; return x;}int main() { int n, m; while (~scanf("%d%d", &n, &m) && (n || m)) { for (int i = 0; i <= n+10; i++) dp[i] = 0, fly[i] = 0; int x, y; for (int i = 1; i <= m; i++) { scanf("%d%d", &x, &y); fly[x] = y; } for (int i = n-1; i >= 0; i--) { dp[i] = 1.0 / 6.0 * (dp[to(i+1)]+dp[to(i+2)]+dp[to(i+3)]+dp[to(i+4)]+dp[to(i+5)]+dp[to(i+6)]) + 1; } printf("%.4f\n", dp[0]); } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。