zoj3640(概率DP求期望)
来源:互联网 发布:中国食品安全知乎 编辑:程序博客网 时间:2024/04/28 07:10
地址:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=4808
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<cmath>#include<cstdio>#include<cstring>#include<iostream>//#include<algorithm>using namespace std;double p[10010];int l[10010];int main(){ int n,f; while(scanf("%d%d",&n,&f)>0) { memset(p,0,sizeof(p)); int maxx=0; for(int i=1;i<=n;i++) { scanf("%d",&l[i]); maxx=max(maxx,l[i]); } maxx=max(maxx,f)+1; for(int i=maxx;i>=f;i--) { for(int j=1;j<=n;j++) { int k=(int)((1.0+sqrt(5.0))/2*l[j]*l[j]); if(l[j]<i) p[i]+=k*1.0/n; else p[i]+=(p[min(maxx,i+l[j])]+1)/n; //如果超过了maxx那所有情况都一样 } } printf("%.3lf\n",p[f]); } return 0;}
- zoj3640(概率DP求期望)
- [ZOJ3640]Help Me Escape(概率期望dp)
- zoj3640 Help Me Escape 【概率DP+期望】
- 概率dp 求期望
- ZOJ3640 Help Me Escape(概率dp)
- poj2096(概率DP求期望)
- hdu3853(概率DP求期望)
- hdu4405(概率DP求期望)
- hdu3538(概率dp求期望)
- HDU4405(概率DP求期望)
- zoj3329 概率dp求期望
- hdoj3853LOOPS【概率dp求期望】
- hdu4035 概率DP求期望
- hdu4652 概率dp求期望
- Poj 2096 (dp求期望) 概率dp
- hdu 3853 LOOPS(概率DP求期望)
- ZOJ 3329 One Person Game(概率DP,求期望)
- POJ 2096 Collecting Bugs(概率DP求期望)
- codeforces Letter
- xcode 4.5的版本控制
- 使用JAVA连接AccDB文件,GROUP BY 出现多余结果的问题
- ActionContext和ServletActionContext小结(写的非常好)
- RTC Plain .zip Files 32位和64位
- zoj3640(概率DP求期望)
- HDU 1465 不容易系列之一。
- c语言面试题 指针30个常错题型
- Chrome中canvas上drawImage无法画出image的解决办法
- iOS Dev (42) 三种定位方式的性能比较
- 关于abstract类的实验
- Android 对话框(Dialog)大全 建立你自己的对话框
- CSS兼容性问题
- RPM软件包管理