Discovering Gold LightOJ
来源:互联网 发布:内功真的存在吗 知乎 编辑:程序博客网 时间:2024/05/23 23:33
You are in a cave, a long cave! The cave can be represented by a 1 x N grid. Each cell of the cave can contain any amount of gold.
Initially you are in position 1. Now each turn you throw a perfect6 sided dice. If you get X in the dice after throwing, you addX to your position and collect all the gold from the new position. If your new position is outside the cave, then you keep throwing again until you get a suitable result. When you reach theNth position you stop your journey. Now you are given the information about the cave, you have to find out theexpected number of gold you can collect using the given procedure.
Input starts with an integer T (≤ 100), denoting the number of test cases.
Each case contains a blank line and an integer N (1 ≤ N ≤ 100) denoting the dimension of the cave. The next line containsN space separated integers. The ith integer of this line denotes the amount of gold you will get if you come to theith cell. You may safely assume that all the given integers will be non-negative and no integer will be greater than1000.
For each case, print the case number and the expected number of gold you will collect. Errors less than10-6 will be ignored.
3
1
101
2
10 3
3
3 6 9
Case 1: 101.0000000000
Case 2: 13.000
Case 3: 15
思路:
设从x位置到n位置的期望值为Ex,那么Ex=gold[x]+E(x+1)+E(x+2)+E(x+3)+E(x+4)+E(x+5)+E(x+6)
又因为你已经知道了E(n)=gold[n],所以你只要在合理的情况下从n位置递推到1位置即可
#include<bits/stdc++.h>using namespace std;double dp[166];int main(){ int kase; scanf("%d",&kase); for(int t=1; t<=kase; t++) { int n; scanf("%d",&n); for(int i=1; i<=n; i++) { scanf("%lf",&dp[i]); } for(int i=n; i>=1; i--) { int s=min(6,n-i); for(int j=1; j<=s; j++) { dp[i]+=1.0/s*dp[i+j]; } } printf("Case %d: %.8f\n",t,dp[1]); }}
- LightOJ 1030 Discovering Gold
- LightOJ 1030-Discovering Gold
- LightOJ 1030 Discovering Gold
- lightoj 1030 Discovering Gold
- lightoj 1030 Discovering Gold
- LightOJ 1030 Discovering Gold
- Lightoj 1030 - Discovering Gold
- Discovering Gold LightOJ
- Discovering Gold LightOJ
- Discovering Gold LightOJ
- LightOj-1030-Discovering Gold
- lightoj 1030 Discovering Gold[ 期望 ]
- LightOJ - 1030 Discovering Gold 期望
- LightOJ 1030 Discovering Gold【概率】
- LightOJ 1030 Discovering Gold 概率
- lightoj 1030 - Discovering Gold 【期望】
- LightOJ 1030 Discovering Gold(期望)
- 【概率&期望】Discovering Gold LightOJ
- 六、shell注释
- 从平面上最近的点对,谈谈分治算法
- es6 map
- eclipse对接JDK
- ECMAScript6(一)
- Discovering Gold LightOJ
- 金融类APP被拒
- 装饰者模式简单试验
- array转list,list转array
- 关于matlab与C++混合编程
- 数学竞赛中数论问题及几何解题心得分享
- 51nod 1624 取余最长路(枚举+二分)
- Qt 之 QSqlResult Class
- 京东云服务器搭建mysql+jdk+tomact