关闭

训练3 习题22

标签: acm
81人阅读 评论(0) 收藏 举报
分类:

题目:
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 . <br>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.<br><br>Notes and Constraints<br> 0 < T <= 100<br> 0.0 <= P <= 1.0<br> 0 < N <= 100<br> 0 < Mj <= 100<br> 0.0 <= Pj <= 1.0<br> 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



思路:   01 背包问题     dp[i]表示偷价值为 i 时不被抓的概率  表达式为dp[j] = max(dp[j] , dp[j-m[i]] * (1-p[i]));求出不被逮捕的所能强盗的最大钱数。


#include <stdio.h>
#include <string.h>


int m[101];
double p[101],dp[10001];


int main()
{
    int t,n,i,j,sum;
    double P;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lf %d",&P,&n);
        sum = 0;
        P = 1 - P;
        for(i = 0; i < n; i++)
        {
            scanf("%d %lf",&m[i],&p[i]);
            sum += m[i];
            p[i] = 1 - p[i];
        }
        memset(dp,0,sizeof(dp));
        dp[0] = 1;
        for(i = 0; i < n; i++)
            for(j = sum; j >= m[i]; j--)
                if(dp[j] < dp[j-m[i]]*p[i])
                    dp[j] = dp[j-m[i]]*p[i];
        for(i = sum; i >= 0&&dp[i] < P; i--);
        printf("%d\n",i);
    }
    return 0;
}

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:5915次
    • 积分:440
    • 等级:
    • 排名:千里之外
    • 原创:40篇
    • 转载:0篇
    • 译文:0篇
    • 评论:2条
    最新评论