【ZOJ3640】
来源:互联网 发布:新闻网站源码 编辑:程序博客网 时间:2024/04/28 06:24
Background
If thou doest well, shalt thou not be accepted? and if thou doest not well, sin lieth at the door. And unto thee shall be his desire, and thou shalt rule over him.
And Cain talked with Abel his brother: and it came to pass, when they were in the field, that Cain rose up against Abel his brother, and slew him.
And the LORD said unto Cain, Where is Abel thy brother? And he said, I know not: Am I my brother's keeper?
And he said, What hast thou done? the voice of thy brother's blood crieth unto me from the ground.
And now art thou cursed from the earth, which hath opened her mouth to receive thy brother's blood from thy hand;
When thou tillest the ground, it shall not henceforth yield unto thee her strength; a fugitive and a vagabond shalt thou be in the earth.
—— Bible Chapter 4
Now Cain is unexpectedly trapped in a cave with N paths. Due to LORD's punishment, all the paths are zigzag and dangerous. The difficulty of the ith path is ci.
Then we define f as the fighting capacity of Cain. Every day, Cain will be sent to one of the N paths randomly.
Suppose Cain is in front of the ith path. He can successfully take ti days to escape from the cave as long as his fighting capacity f is larger than ci. Otherwise, he has to keep trying day after day. However, if Cain failed to escape, his fighting capacity would increase ci as the result of actual combat. (A kindly reminder: Cain will never died.)
As for ti, we can easily draw a conclusion that ti is closely related to ci. Let's use the following function to describe their relationship:
After D days, Cain finally escapes from the cave. Please output the expectation of D.
Input
The input consists of several cases. In each case, two positive integers N and f (n ≤ 100, f ≤ 10000) are given in the first line. The second line includes N positive integers ci (ci ≤ 10000, 1 ≤ i ≤ N)
Output
For each case, you should output the expectation(3 digits after the decimal point).
Sample Input
3 11 2 3
Sample Output
6.889
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std;int n,f;int c[110];double dp[20010];double a = (1+sqrt(5))*0.5;//dp[i] = 1/n * t[j] (c[j] > i)//dp[i] = 1/n*(1 + dp[i+c[j]) (c[j] <= i)int main(){ while(scanf("%d%d",&n,&f) != EOF){int Max = 0;for(int i=0;i<n;i++) {scanf("%d",&c[i]);Max = max(Max,c[i]);}for(int i=2*Max;i>=f;i--){dp[i] = 0;for(int j=0;j<n;j++){if(i>c[j]) dp[i] += (int)(a*c[j]*c[j]);else dp[i] += (1 + dp[i+c[j]]);}dp[i] /= n;}printf("%.3lf\n",dp[f]);} return 0;}
- 【ZOJ3640】
- zoj3640 Help Me Escape
- ZOJ3640-Help Me Escape
- ZOJ3640 Help Me Escape
- ZOJ3640----Help Me Escape
- zoj3640(概率DP求期望)
- ZOJ3640之简单慨率DP
- ZOJ3640 Help Me Escape(概率dp)
- zoj3640 Help Me Escape 【概率DP+期望】
- [ZOJ3640]Help Me Escape(概率期望dp)
- [Cocos2d-x][消除游戏实战][1][了解游戏]
- 解密SVM系列(五):matlab下libsvm的简单使用
- 学习Hadoop的前奏——初识zookeeper
- 最短路 Floyd算法
- POJ3667--Hotel(区间合并)
- 【ZOJ3640】
- 发帖水王问题-一组数中某个数超过一半或者几个数超过x+1分之一
- 【socket】关于socket链接错误问题
- 链表(二):单循环链表
- back_doorctf_2013_bin_500
- 吵啥吵?
- 送票
- C++对象模型——临时性对象 (第六章)
- HDU 4268 AliceBob大牌覆盖小牌-思维(贪心+multiset)