概率dp入门12/14
来源:互联网 发布:炉石传说盒子for mac 编辑:程序博客网 时间:2024/05/18 16:54
转移方程有时候比较灵活。
一般求概率是正推,求期望是逆推。通过题目可以体会到这点。
没有老师给题了只能自己去poj上补题
poj 2096 Collecint Bugs
Description
Two companies, Macrosoft and Microhard are in tight competition. Microhard wants to decrease sales of one Macrosoft program. They hire Ivan to prove that the program in question is disgusting. However, Ivan has a complicated problem. This new program has s subcomponents, and finding bugs of all types in each subcomponent would take too long before the target could be reached. So Ivan and Microhard agreed to use a simpler criteria --- Ivan should find at least one bug in each subsystem and at least one bug of each category.
Macrosoft knows about these plans and it wants to estimate the time that is required for Ivan to call its program disgusting. It's important because the company releases a new version soon, so it can correct its plans and release it quicker. Nobody would be interested in Ivan's opinion about the reliability of the obsolete version.
A bug found in the program can be of any category with equal probability. Similarly, the bug can be found in any given subsystem with equal probability. Any particular bug cannot belong to two different categories or happen simultaneously in two different subsystems. The number of bugs in the program is almost infinite, so the probability of finding a new bug of some category in some subsystem does not reduce after finding any number of bugs of that category in that subsystem.
Find an average time (in days of Ivan's work) required to name the program disgusting.
Input
Output
Sample Input
1 2
Sample Output
3.0000题意:
有n类bug和s个子系统,bug数量不限,且每天只能发现一个bug,
要求的是当在s个子系统中发现n类bug时所需要天数的期望(平均天数)。
分析:
先确定状态,假设dp[i][j]表示已经在j个子系统中发现i类bug时所用天数的期望,明显dp[n][s] = 0。然后推导状态之间的转移,依据dp[i][j]的含义我们不难发现,下一天发现bug的情况只可能是以下四种情况:
1、在新的子系统中发现新的bug,即dp[i+1][j+1]
3、在已经发现过bug的子系统中发现新的bug,即dp[i+1][j]
2、在新的子系统中发现已经发现过的bug,即dp[i][j+1]
4、在已经发现过bug的子系统中发现已经发现过的bug,即dp[i+1][j+1]
同样,不难得出上述四种情况对应的概率分别为:p1 = (n-i)*(s-j) / (n*s),p2 = (n-i)*(j) / (n*s),p3 = i*(s-j) / (n*s),p4 = i*j / (n*s)。
综上,我们的状态转移方程,同样根据期望的定义,dp[i][j] = p1*dp[i+1][j+1] + p2*dp[i+1][j] + p3*dp[i][j+1] + p4*dp[i][j] + 1,移项合并一下,dp[i][j] = (p1*dp[i+1][j+1] + p2*dp[i+1][j] + p3*dp[i][j+1] + 1) / (1-p4)。这样一来,我们要求的答案就是dp[0][0]。
源代码:
- 概率dp入门12/14
- 概率DP【入门】
- HDU4405概率DP入门
- hdu4405概率dp入门
- 概率dp入门
- 概率DP入门题
- 【概率DP入门】
- 概率DP入门
- poj2096 概率dp入门
- 概率DP入门小结
- 概率dp 入门
- zoj_3822_概率dp入门
- 概率DP入门大集合
- 概率DP入门大集合
- 概率DP —— 入门
- poj2096之概率DP入门
- hdu3853之概率dp入门
- ACM-概率dp之入门
- 分享如何集成通用Mapper
- checked exception和runtime exception and error
- 订单模块 学习他人代码之路
- React Native0.50+开发指导(中文更新说明)
- Slim研读笔记七乱入篇之Monolog(下)
- 概率dp入门12/14
- R语言之数据预处理笔记
- JavaScript 数组的栈方法
- 01-day01
- UVA679
- mybatis常见面试题
- A Survey of Monte Carlo Tree Search Method 笔记以及中文翻译概要
- 【备忘】最新大数据快速数据挖掘平台RapidMiner数据分析视频教程下载
- 02-day02