• hdu 2955 Robberies 0-1背包/概率初始化


    /*Robberies
    
    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 13854    Accepted Submission(s): 5111
    
    
    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.
     
    
    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
     
    
    Source
    IDI Open 2009
     
    */
    //0-1背包    公式:dp[i] = max(dp[i], dp[i-c]*(1-rp))
    #include <cstdio>
    #include <cstring>
    const int maxn = 10000 + 10;
    double p, pj[maxn], dp[maxn];
    int n, mj[maxn], sum;
    double Max(double a, double b)
    {
        return a > b ? a : b;
    }
    void ZeroOnePack(int m, double rp)
    {
        for(int i = sum; i >= m; i--){
            dp[i] = Max(dp[i], dp[i-m]*(1-rp));
        }
    }
    
    int main()
    {
        int t;
        while(~scanf("%d", &t)){
            while(t--){
                scanf("%lf%d", &p, &n);
                sum = 0;
                    for(int i = 0; i < n; i++){
                        scanf("%d%lf", &mj[i], &pj[i]);
                        sum += mj[i];
                    }
                    memset(dp, 0, sizeof(dp));
                    dp[0] = 1;
                    for(int i = 0; i < n; i++)
                        ZeroOnePack(mj[i], pj[i]);
                    for(int i = sum; i >= 0; i--)
                        if(dp[i] > 1-p){
                            printf("%d
    ", i); break;
                        }
            }
        }
        return 0;
    } 
  • 相关阅读:
    Halcon HWindowControl 控件中图像的缩放与移动
    OpenCV cv::mean()函数详解
    OpenCV 霍夫变换(Hough Transform)
    OpenCV 图像分割
    OpenCV 使用ROI进行图像切割
    OpenCV 轮廓查找与绘制-最小外接矩形
    OpenCV 提取轮廓的凸包、外包矩形、最小外包矩形、最小外包圆
    KubeDL 加入 CNCF Sandbox,加速 AI 产业云原生化
    DataWorks 功能实践速览
    coredump 瘦身风云
  • 原文地址:https://www.cnblogs.com/ACFLOOD/p/4291264.html
Copyright © 2020-2023  润新知