有N种物品和一个容量为V 的背包。第i种物品最多有Mi件可用,每件耗费的空间是Ci ,价值是Wi 。求解将哪些物品装入背包可使这些物品的耗费的空间 总和不超过背包容量,且价值总和最大。
void test_multiPack() {
vector<int> weight = { 1,3,4 };
vector<int> value = { 15,20,30 };
vector<int> nums = { 2,3,2 };
int bagweight = 10;
//将每个物品展开 转化为01背包问题
for (int i = 0; i < nums.size(); i++)
{
while (nums[i] > 1)
{
weight.push_back(weight[i]);
value.push_back(value[i]);
nums[i]--;
}
}
//初始化dp数组
vector<int> dp(bagweight + 1, 0);
//遍历顺序 先物品后背包 背包倒序
for (int i = 0; i < weight.size(); i++)
{
for (int j = bagweight; j >= weight[i]; j--)
{
dp[j] = max(dp[j], dp[j - weight[i]] + value[i]);
}
for_each(dp.begin(), dp.end(), [=](int x) {cout << x << ' '; });
cout << endl;
}
}
打印的dp数组: