动态规划1-Robberies-POJ-2955
来源:互联网 发布:如何投资 知乎 编辑:程序博客网 时间:2024/06/05 20:15
Robberies
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7107 Accepted Submission(s): 2666
Problem Description
The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to work in the lucrative business of bank robbery only for a short while, before retiring to a comfortable job at a university.
For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.
His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
For a few months now, Roy has been assessing the security of various banks and the amount of cash they hold. He wants to make a calculated risk, and grab as much money as possible.
His mother, Ola, has decided upon a tolerable probability of getting caught. She feels that he is safe enough if the banks he robs together give a probability less than this.
Input
The first line of input gives T, the number of cases. For each scenario, the first line of input gives a floating point number P, the probability Roy needs to be below, and an integer N, the number of banks he has plans for. Then follow N lines, where line j gives an integer Mj and a floating point number Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
Bank j contains Mj millions, and the probability of getting caught from robbing it is Pj .
Output
For each test case, output a line with the maximum number of millions he can expect to get while the probability of getting caught is less than the limit set.
Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
Notes and Constraints
0 < T <= 100
0.0 <= P <= 1.0
0 < N <= 100
0 < Mj <= 100
0.0 <= Pj <= 1.0
A bank goes bankrupt if it is robbed, and you may assume that all probabilities are independent as the police have very low funds.
Sample Input
30.04 31 0.022 0.033 0.050.06 32 0.032 0.033 0.050.10 31 0.032 0.023 0.05
Sample Output
246
这里涉及到概率的问题,而不是简单的相加。可以计算逃脱的概率,这样是连续相乘的,相对方便一些。
和平常的01背包问题有些差别,这里用
opt[j] 表示在获得金钱j时最大的逃脱概率
最后,在找出满足要求的最大j。
#include <iostream>using namespace std;int marr[101];double parr[101];int k,n;double up;int ans;double opt[100001]; // opt[j] 表示在获得金钱j时最大的逃脱概率int sum;int main() {cin >> k;while(k--){double tb;cin >> up >> n;sum = 0;for(int i=0; i<n; i++){ // 计算所有银行金钱的和cin >> marr[i] >> parr[i];sum += marr[i];}opt[0] = 1.0;for(int i=1; i<=sum; i++)opt[i] = 0.0;for(int i=0; i<n; i++){for(int j=sum; j>=marr[i]; j--){tb = opt[ j-marr[i] ] * (1-parr[i]);if(tb > opt[j])opt[j] = tb;}}for(int i=sum; i>=0; i--){ //遍历,找到满足要求的最大金钱数if(1-opt[i] <= up){cout << i << endl;break;}}}return 0;}
- 动态规划1-Robberies-POJ-2955
- 动态规划:HDU-2955-0-1背包问题:Robberies
- HDU2955--Robberies--动态规划
- [acm]动态规划-Robberies
- HDU 2955 Robberies(01背包)(动态规划)
- 动态规划专题(01背包)HDU 2955-Robberies
- POJ 2955 Robberies
- POJ 2955 DP动态规划
- poj 2955 动态规划--括号匹配
- POJ 2955 Brackets [区间DP]【动态规划】
- POJ 2955 Brackets(动态规划)
- poj 2411 动态规划
- Poj 1157(动态规划)
- POJ 1651动态规划
- Poj 1221 动态规划
- POJ 3186 动态规划
- [poj]动态规划2479
- [poj]动态规划1015
- close_wait状态和time_wait状态
- android 数据连接关闭的情况下如何让彩信发不出去
- android 4.1 键盘静音键 KEYCODE_VOLUME_MUTE 无效问题
- wordpress怎样获得文章中的第一张图片
- android 编辑彩信,加入几页铃声,预览暂停界面,铃声名字不见了
- 动态规划1-Robberies-POJ-2955
- android 新建一个草稿,保存,然后全部删除会话,关机再开机后还会显示保存的草稿
- IGFrame Ball Test 示例
- 困惑(线程锁)
- 进程切换分两步
- org.hibernate.exception.GenericJDBCException: 无法转换为内部表示
- android CMCC入库,终端不支持短信和彩信重发的问题
- 静态方法与实例方法的区别
- Linux系统内核文件Cache管理机制简介