物品无限的背包问题:
有n种物品,每种均有无穷多个。第i种物品的体积为Vi,重量 为Wi。选一些物品装到一个容量为C的背包中,使得背包内物品在总体积不超过C的前提下重量尽量大。1≤n≤100,1≤Vi ≤C≤10000,1≤Wi≤106
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 10000005;
const int INF = 0x3f3f3f3f;
typedef long long ll;
int d[maxn];
int w[maxn], v[maxn];
int n;
int dp(int c) {
int& ans = d[c];
if (ans != -1) return ans;
ans = -INF;
for (int i = 0; i < n; i++) if (c >= v[i])
ans = max(ans, dp(c - v[i]) + w[i]);
return ans;
}
int main() {
int c;
scanf("%d %d", &n, &c);
for (int i = 0; i < n; i++) scanf("%d", &v[i]);
for (int i = 0; i < n; i++) scanf("%d", &w[i]);
memset(d, -1, sizeof(d));
d[0] = 0;
int ans = dp(c);
printf("%d\n", ans);
}