概率dp LightOJ 1030 Discovering Gold
来源:互联网 发布:seo渠道 编辑:程序博客网 时间:2024/05/21 13:57
Description
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 perfect 6 sided dice. If you get X in the dice after throwing, you add X 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 the Nth position you stop your journey. Now you are given the information about the cave, you have to find out the expectednumber of gold you can collect using the given procedure.
Input
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 contains N space separated integers. The ith integer of this line denotes the amount of gold you will get if you come to the ith cell. You may safely assume that all the given integers will be non-negative and no integer will be greater than 1000.
Output
For each case, print the case number and the expected number of gold you will collect. Errors less than 10-6 will be ignored.
Sample Input
3
1
101
2
10 3
3
3 6 9
Sample Output
Case 1: 101.0000000000
Case 2: 13.000
Case 3: 15
本题就是利用dp求概率,关键就是注意从抹点到另一点的概率是它本身的概率乘以到另一点的概率,这样递推一下就行。
#include <stdio.h>#include <cstring>const int maxn=100+10;double dp[maxn];int a[maxn];int main(){int t,icase;int i,j;scanf("%d",&t);for(icase=1;icase<=t;icase++){double ans=0;memset(dp,0,sizeof(dp));dp[1]=1;int num;scanf("%d",&num);for(i=1;i<=num;i++)scanf("%d",&a[i]);for(i=1;i<=num;i++){double h;if(num-i<6)h=num-i;elseh=6;for(j=1;j<=h;j++){dp[i+j]+=dp[i]*(double)(1.0/h);}ans+=(double)a[i]*dp[i];}printf("Case %d: %.10lf\n",icase,ans);}return 0;}
- 1030 - Discovering Gold (lightoj 1030 概率DP)
- lightoj 1030 Discovering Gold (基础概率dp)
- [LightOJ 1030] Discovering Gold (概率DP)
- lightoj 1030discovering gold(概率dp)
- 概率dp LightOJ 1030 Discovering Gold
- LightOJ 1030 Discovering Gold 概率dp
- lightoj 1030 Discovering Gold 概率dp
- LightOJ 1030 Discovering Gold【概率dp】
- LightOJ 1030 Discovering Gold【概率】
- LightOJ 1030 Discovering Gold 概率
- lightoj 1030 Discovering Gold 概率dp求期望
- lightoj 1030 Discovering Gold 概率期望
- 【期望dp】LightOJ 1030 Discovering Gold
- LightOJ 1030 - Discovering Gold (期望dp)
- LightOJ 1030 - Discovering Gold(dp)
- LightOJ 1030 Discovering Gold(期望DP)
- 【LightOJ 1030】Discovering Gold(期望DP)
- 【概率&期望】Discovering Gold LightOJ
- SSH内网能连通外网连接时拒绝
- Ubuntu1404安装ROS
- 最全iOS开发之第三方库
- Qt---按钮
- php异步任务处理 (php-resque)
- 概率dp LightOJ 1030 Discovering Gold
- Ural 1028. Stars(树状数组)
- HDOJ -- 1222 Wolf and Rabbit
- Git删除远程Tag、分支
- 自动拨打电话,自动发送短信,测试类
- 多校赛第七场
- 罪犯转移问题思考——2016百度编程题
- (OK) Fedora 24 开机自动启动脚本 - rc.local - rc-local.service
- Java SE学习笔记-多态