hdu2955 Robberies

0-1背包问题，总容量设为从所有银行获益的总和，价值为不被抓捕的概率。

http://acm.hdu.edu.cn/showproblem.php?pid=2955

#include <cstring>
#include <cstdio>
#include <algorithm>

using namespace std;

const int maxn = 1e4 + 10;
const int maxm = 1e2 + 10;

int v[maxm], n;
double dp[maxn], p[maxm], P;

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