思路:经典01背包问题,d(i, j)表示用体积j装前i个物品能获得的最大价值,状态转移方程dp(i, j) = max(d(i-1, j), d(i-1, j-v[i]) + w[i])
AC代码
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <utility>
#include <string>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
#pragma comment(linker, "/STACK:1024000000,1024000000")
#define eps 1e-10
#define inf 0x3f3f3f3f
#define PI pair<int, int>
typedef long long LL;
const int maxn = 1000 + 5;
int d[maxn][maxn], w[maxn], v[maxn];
int n, V;
int solve() {
for(int i = 1; i <= n; ++i)
for(int j = 0; j <= V; ++j) {
d[i][j] = (i == 1 ? 0 : d[i-1][j]);
if(j >= v[i]) d[i][j] = max(d[i][j], d[i-1][j-v[i]] + w[i]);
}
return d[n][V];
}
int main() {
int T;
scanf("%d", &T);
while(T--) {
scanf("%d%d", &n, &V);
for(int i = 1; i <= n; ++i) scanf("%d", &w[i]);
for(int i = 1; i <= n; ++i) scanf("%d", &v[i]);
printf("%d\n", solve());
}
return 0;
}
如有不当之处欢迎指出!