zoukankan      html  css  js  c++  java
  • HDU 2955(0-1背包问题)

    题目链接:http://acm.hust.edu.cn/vjudge/contest/view.action?cid=87125#problem/M

    题目:

    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.
     

    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 .
     

    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.
     

    Sample Input

    3
    0.04  3
    1  0.02
    2  0.03
    3  0.05
    0.06  3
    2  0.03
    2  0.03
    3  0.05
    0.10  3
    1  0.03
    2  0.02
    3  0.05
     

    Sample Output

    2
    4
    6       
     题意:
       求出在规定的概率内,能拿到的最多的钱。   
    分析:
           把每个银行的储钱量之和当成背包容量,然后概率当成价值来求。
     这里是被抓的概率,我们把他转化成不被抓的概率。
     状态:f[j]:表示一共抢了j元的最大逃脱率;
     状态转移方程:f[j]=max{f[j],f[j-m[i]]*(1-q[i])}

     

     1 #include<iostream> 
     2 #include<cstring>  
     3 using namespace std;
     4 double q[105],f[10005];
     5 int  m[105];
     6 double  max(double  a,double b)
     7 {
     8 if(a>b) return a;
     9 else return b;
    10 }
    11 int main()
    12 {
    13    int t,n,i,j,M;
    14    double p;
    15    cin>>t;
    16    while(t--)
    17    {
    18        M=0;
    19        memset(f,0,sizeof(f));
    20     cin>>p>>n;
    21     for(i=1;i<=n;i++)
    22     {
    23         cin>>m[i]>>q[i];
    24         M=M+m[i];
    25     }
    26     f[0]=1;
    27    for(i=1;i<=n;i++)
    28        for(j=M;j>=m[i];j--)
    29        f[j]=max(f[j],f[j-m[i]]*(1-q[i])); 
    30        for(i=M;i>=0;i--)
    31        {
    32        if(f[i]>=1-p)
    33        {
    34            cout<<i<<endl;
    35            break;
    36        }
    37        }
    38    }
    39     return 0;
    40  }
     
     
  • 相关阅读:
    JavaScript 格式化数字
    浅析C#中单点登录的原理和使用
    从银行转账失败到分布式事务:总结与思考
    计算机网络资料
    阿里巴巴Java开发规约插件p3c详细教程及使用感受
    程序员如何打造属于自己的云笔记服务
    sql server2016里面的json功能
    mac pro 开启三只滑动选中文本
    技术网站
    idea gradle项目导入
  • 原文地址:https://www.cnblogs.com/fenhong/p/4732740.html
Copyright © 2011-2022 走看看