2021-07-23大一暑假第一周下 背包

Robberies 背包问题

题目：
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.

输入：
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 .

输出：
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.

样例：
输入：
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
输出：
2
4
6

————————————————————————————————————————
题意：
一个小偷去偷银行，他妈妈告诉他被抓的概率为P，小偷已经知道每个银行的资产和被抓的概率，请你求出小偷在不被抓的情况下最多能偷多少。

思路：
类似01背包
首先你要把所能抢的钱的范围求出来，这个范围用来定义dp的长度；在dp里面记录抢这一部分钱可能被抓的概率；
动归方程：dp[j]=max(dp[j],dp[j-a[i]]*(1-b[i]))；
————————————————————————————————————————
代码：

#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
using namespace std;
double dp[100010],b[100010];//dp不被抓住的概率
int a[100010];
int main()
{
    int t,i,j,k,n;
    double p,s;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf %d",&p,&n);
        k=0;
        for(i=0;i<n;i++)
        {
            scanf("%d %lf",&a[i],&b[i]);
            k+=a[i];
        }
        memset(dp,0,sizeof(dp));
        dp[0]=1.0;
        for(i=0;i<n;i++)
        {
            for(j=k;j>=a[i];j--)
            {
                dp[j]=max(dp[j],dp[j-a[i]]*(1-b[i]));
                //
            }
        }
        for(i=k;i>=0;i--)//从最多的金额开始判断
        {
            if(dp[i]>=(1-p))
            {
                printf("%d\n",i);
                break;
            }
        }
    }
    return 0;
}