HDU2955-Robberies（0-1背包）

题目链接

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

思路

简单的01背包，但是要想清楚状态。
最先考虑的状态是选到第i个物品，被抓的概率是j的时候的最大价值，但是被抓的概率是float，肯定会产生误差
因此将状态表示为选到第i个物品，已经抢到的钱是j的时候，不被抓的最大概率为d[i][j]
状态表示

d[i][j]：选到第i个物品，已经抢到的钱为j的时候的最大不被抓的概率

转移方程

d[i][j] = max(d[i - 1][j], d[i - 1][j - v[i]] * (1 - p[i])

细节

1. 滚动数组
2. 概率是相乘不是相加

代码

#include <iostream>
#include <cstring>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <queue>
#include <sstream>
#include <iomanip>
#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <climits>
#include <deque>
#include <bitset>
#include <algorithm>
using namespace std;

#define PI acos(-1.0)
#define LL long long
#define PII pair<int, int>
#define PLL pair<LL, LL>
#define mp make_pair
#define IN freopen("in.txt", "r", stdin)
#define OUT freopen("out.txt", "wb", stdout)
#define scan(x) scanf("%d", &x)
#define scan2(x, y) scanf("%d%d", &x, &y)
#define scan3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define sqr(x) (x) * (x)
#define pr(x) cout << #x << " = " << x << endl
#define lc o << 1
#define rc o << 1 | 1
#define pl() cout << endl
#define CLR(a, x) memset(a, x, sizeof(a))
#define FILL(a, n, x) for (int i = 0; i < n; i++) a[i] = x

const int maxn = 105;
const int maxm = 10000 + 5;
double d[maxm], _p, p[maxn];
int v[maxn], n, tot;

int dp() {
    CLR(d, 0);
    d[0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = tot; j >= v[i]; j--) {
            d[j] = max(d[j], d[j - v[i]] * (1 -  p[i]));
        }
    }
    for (int j = tot; j >= 0; j--) {
        if (d[j] > 1 - _p) return j;
    }
    return 0;
}

int main() {
    int T;
    scan(T);
    while (T--) {
        scanf("%lf%d", &_p, &n);
        tot = 0;
        for (int i = 1; i <= n; i++) {
            scanf("%d%lf", &v[i], &p[i]);
            tot += v[i];
        }
        printf("%d\n", dp());
    }
    return 0;
}