Bone Collector_0/1背包问题_DP

Problem - 2602http://acm.hdu.edu.cn/showproblem.php?pid=2602

#include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;
const int V = 1001, N = 1001;
struct BONE {
    int value, volume;
}bone[N];
int dp[N][V] = {0}; // dp[i][j]表示用前i种骨头装入体积为j的背包的最优解
int n, volume;
int solve() {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= volume; j++) {
            if (j < bone[i].volume) {
                dp[i][j] = dp[i - 1][j];
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - bone[i].volume] + bone[i].value);
            }
        }
    }
    return dp[n][volume];
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        cin >> n >> volume;
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].value;
        }
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].volume;
        }
        cout << solve() << endl;
    }
    return 0;
}

打印选择路径：

#include <iostream>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
const int V = 1001, N = 1001;
struct BONE {
    int value, volume;
}bone[N];
int dp[N][V] = {0}; // dp[i][j]表示用前i种骨头装入体积为j的背包的最优解
int n, volume;
void printPath() {
    vector<int>path;
    for (int i = n, j = volume; i > 0; i--) {
        if (dp[i][j] != dp[i - 1][j]) {
            path.push_back(i);
            j -= bone[i].volume;
        }
    }
    cout << "path: ";
    for (int i = path.size() - 1; i >= 0; i--) {
        cout << path[i] << " ";
    }
    cout << endl;
}
int solve() {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j <= volume; j++) {
            if (j < bone[i].volume) {
                dp[i][j] = dp[i - 1][j];
            } else {
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - bone[i].volume] + bone[i].value);
            }
        }
    }
    return dp[n][volume];
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        cin >> n >> volume;
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].value;
        }
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].volume;
        }
        cout << solve() << endl;
        printPath();
    }
    return 0;
}

滚动数组：

#include <iostream>
#include <string.h>
using namespace std;
typedef long long ll;
const int V = 1001, N = 1001;
struct BONE {
    int value, volume;
}bone[N];
int dp[V] = {0}; // dp[j]表示装入体积为j的背包的最优解
int n, volume;
int solve() {
    memset(dp, 0, sizeof(dp));
    for (int i = 1; i <= n; i++) {
        for (int j = volume; j >= bone[i].volume; j--) {
            dp[j] = max(dp[j], dp[j - bone[i].volume] + bone[i].value);
        }
    }
    return dp[volume];
}
int main() {
    int T;
    cin >> T;
    while (T--) {
        cin >> n >> volume;
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].value;
        }
        for (int i = 1; i <= n; i++) {
            cin >> bone[i].volume;
        }
        cout << solve() << endl;
    }
    return 0;
}