完全背包
每件物品有无限多个
朴素算法
f [ i ] [ j ] = m a x ( f [ i ] [ j ] , f [ i − 1 ] [ j − k ∗ v [ i ] ] + k ∗ w [ i ] ) f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + k * w[i]) f[i][j]=max(f[i][j],f[i−1][j−k∗v[i]]+k∗w[i])与01背包类似
for (int i = 1;i <= n;++i) {
for (int j = 0;j <= m;++j) {
for (int k = 0;v[i] * k <= j;++k) {
f[i][j] = max(f[i][j], f[i - 1][j - k * v[i]] + k * w[i]);
}
}
}
优化做法
易知 f [ i , j ] = Max ( f [ i − 1 , j ] , f [ i − 1 , j − v ] + w , f [ i − 1 , j − 2 v ] + 2 w , f [ i − 1 , j − 3 v ] + 3 w , … ) f[i, j]=\operatorname{Max}(f[i-1, j], f[i-1, j-v]+w, f[i-1, j-2 v]+2 w, \quad f[i-1, j-3 v]+3 w, \ldots) f[i,j]=Max(f[i−1,j],f[i−1,j−v]+w,f[i−1,j−2v]+2w,f[i−1,j−3v]+3w,…)
f [ i , j − v ] = Max ( f [ i − 1 , j − v ] , f [ i − 1 , j − 2 v ] + w , f [ i − 1 , j − 3 v ] + 2 w , … ) f[i, j-v]=\operatorname{Max}(\ \ \ \ \ \ \quad\quad\quad f[i-1, j-v], \quad\quad f[i-1, j-2 v]+w, \quad \ \ f[i-1, j-3 v]+2 w, \ldots) f[i,j−v]=Max( f[i−1,j−v],f[i−1,j−2v]+w, f[i−1,j−3v]+2w,…)
所以 f [ i , j ] = M a x ( f [ i − 1 , j ] , f [ i , j − v ] + w ) f[i,j] = Max(f[i-1,j],f[i,j-v] + w) f[i,j]=Max(f[i−1,j],f[i,j−v]+w)
for (int i = 1;i <= n;++i) {
for (int j = 0;j <= m;++j) {
f[i][j] = f[i - 1][j];
if(j >= v[i])f[i][j] = max(f[i][j],f[i][j -v[i]] + w[i]);
}
}
优化成一维
在计算 f [ j ] f[j] f[j]时 因为 j − v [ i ] j - v[i] j−v[i]小于 j j j 所以此时的 f [ j − v [ i ] ] f[j - v[i]] f[j−v[i]]被更新到了第 i i i维 与原式相符 所以 j j j不需要从大到小枚举
for (int i = 1;i <= n;++i) {
for (int j = v[i];j <= m;++j) {
f[j] = max(f[j],f[j -v[i]] + w[i]);
}
}
当优化到一维时,只有完全背包的体积是从小到大循环的
for 物品:
\quad
for 体积:
\quad \quad \quad
for 决策: