Codeforces730J-Bottles（0-1背包）

题目链接

http://codeforces.com/contest/730/problem/J

思路

0-1背包
状态表示：
$d[i][j][k]$代表选到第i个瓶子时，已经选择了k个瓶子，选中瓶子的总体积为j时，选中的瓶子装水的最大总体积
状态转移：
选：$d[i][j][k] = max(d[i][j][k],d[i - 1]]j - b[i]][k - 1] + a[i])$
不选：$d[i][j][k] = max(d[i][j][k], d]i - 1][j][k])$
目标状态：
$max(d[n][j][K]) （K为目标瓶子数且j ≥ \sum_{i = 1}^na_i 且 j ≤ \sum_{i=1}^nb_i)$

代码

#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)

const int maxn = 105;
const int maxn2 = 100000 + 5;
const int INF = 10000;
PII a[maxn];
int n, sum, K, d[2][maxn2][maxn], s[maxn];

bool cmp(PII x, PII y) {
    return x.second < y.second;
}

int main() {
    scan(n);
    for (int i = 1; i <= n; i++) {
        scan(a[i].first);
        sum += a[i].first;
    }
    int tsum = sum;
    for (int i = 1; i <= n; i++) {
        scan(a[i].second);
        s[i] = s[i - 1] + a[i].second;
    }
    sort(a + 1, a + 1 + n, cmp);
    for (int i = n; i > 0; i--) {
        if (sum <= 0) break;
        K++;
        sum -= a[i].second;
    }
    for (int i = 0; i < maxn2; i++) {
        for (int j = 0; j < maxn; j++)
            d[0][i][j] = d[1][i][j] = -INF;
    }
    d[0][a[1].second][1] = a[1].first;
    d[0][0][0] = 0;
    int t = 0;
    for (int i = 2; i <= n; i++, t ^= 1) {
        for (int j = 0; j <= s[i]; j++) {
            for (int k = 0; k <= K; k++) {
                if (k >= 1 && j >= a[i].second) d[t ^ 1][j][k] = max(d[t ^ 1][j][k], d[t][j - a[i].second][k - 1] + a[i].first);
                d[t ^ 1][j][k] = max(d[t ^ 1][j][k], d[t][j][k]);
            }
        }
    }
    int res = 0;
    for (int j = tsum; j <= s[n]; j++) {
        res = max(res, d[t][j][K]);

    }
    printf("%d %d\n", K, tsum - res);
    return 0;
}