背包问题分类
定义
dp[i][j]:前i件物品体积不超过j的最大价值
0-1背包
状态转移方程: dp[i][j]=max(dp[i−1][j],dp[i−1][j−w[i]]+v[i])
//w:背包重量
//n:物品数量
//weights:每件物品的重量
//values:每件物品的价值
int knapsack_01(int w, int n, vector<int> weights, vector<int> values)
{
vector<vector<int>> dp(n + 1, vector<int>(w + 1));
for(int i = 1; i <= n; ++i)
for (int j = 1; j <= w; ++j)
{
if (j >= weights[i - 1])
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - weights[i - 1]] + values[i - 1]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[n][w];
}
空间优化
int knapsack_01_optimize(int w, int n, vector<int> weights, vector<int> values)
{
vector<int> dp(w + 1);
for (int i = 1; i <= n; ++i)
for (int j = w; j >= 1; --j) //防止覆盖dp[i-1][j-w[i]]的值 采用倒序
{
if (j >= weights[i - 1])
dp[j] = max(dp[j], dp[j - weights[i - 1]] + values[i - 1]);
}
return dp[w];
}
完全背包
状态转移方程: dp[i][j]=max(dp[i−1][j],dp[i][j−w[i]]+v[i])
//w:背包重量
//n:物品数量
//weights:每件物品的重量
//values:每件物品的价值
int knapsack_complete(int w, int n, vector<int> weights, vector<int> values)
{
vector<vector<int>> dp(n + 1, vector<int>(w + 1));
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= w; ++j)
{
if (j >= weights[i - 1])
dp[i][j] = max(dp[i - 1][j], dp[i][j - weights[i - 1]] + values[i - 1]);
else
dp[i][j] = dp[i - 1][j];
}
return dp[n][w];
}
空间优化
int knapsack_complete_optimize(int w, int n, vector<int> weights, vector<int> values)
{
vector<int> dp(w + 1);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= w; ++j) //采用正序 (和01不同)
{
if (j >= weights[i - 1])
dp[j] = max(dp[j], dp[j - weights[i - 1]] + values[i - 1]);
}
return dp[w];
}
参考:
https://blog.csdn.net/weixin_43412762/article/details/129485663