这里的背包都是花费不超过
j
的情况下的背包最大值
这里的背包都是花费不超过j的情况下的背包最大值
这里的背包都是花费不超过j的情况下的背包最大值
花费体积为
j
时,初始化就会都是负无穷,只有
f
[
0
]
[
0
]
=
0
花费体积为j时,初始化就会都是负无穷,只有f[0][0] = 0
花费体积为j时,初始化就会都是负无穷,只有f[0][0]=0
花费最多为
j
时,初始化就都是
0
了
花费最多为j时,初始化就都是0了
花费最多为j时,初始化就都是0了
01背包
//二维代码
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e3 + 10;
int f[N][N], v[N], w[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i];
}
for(int j = 0; j <= m; j ++) f[0][j] = 0;
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-1][j-v[i]] + w[i]);
}
}
cout << f[n][m] << endl;
return 0;
}
//一维代码
//二维代码的等价变形,就是改变for循环顺序,让f[j]为未更新过的i-1层的f[j]
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e3 + 10;
int f[N], v[N], w[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i];
}
for(int j = 0; j <= m; j ++) f[j] = 0;
for(int i = 1; i <= n; i ++)
{
for(int j = m; j >= v[i]; j --)
{
f[j] = max(f[j], f[j-v[i]] + w[i]);
}
}
cout << f[m] << endl;
return 0;
}
完全背包
//二维代码
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e3 + 10;
int f[N][N], v[N], w[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i];
}
for(int i = 0; i <= m; i ++) f[0][i] = 0;
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]);
}
}
}
cout << f[n][m] << endl;
return 0;
}
//一维代码,这次我们需要第i层的j所以for循环从小到大
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e3 + 10;
int f[N], v[N], w[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i];
}
for(int i = 0; i <= m; i ++) f[i] = 0;
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]);
}
}
cout << f[m] << endl;
return 0;
}
多重背包
单调队列做法理解
图片来自 https://www.acwing.com/solution/content/53507/
//二维朴素版代码
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N = 1e2 + 10;
int f[N][N], v[N], w[N], s[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 0; i <= m; i ++) f[0][m] = 0;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i] >> s[i];
}
for(int i = 1; i <= n; i ++)
{
for(int j = 0; j <= m; j ++)
{
for(int k = 0; k <= s[i] && j >= k*v[i]; k ++)
{
f[i][j] = max(f[i][j], f[i-1][j-k*v[i]] + k*w[i]);
}
}
}
cout << f[n][m] << endl;
return 0;
}
//二进制优化版代码
//就是任何一个数字都可以由多个二的次方组成
//因为任何一个数都可以用二进制来表示,所以我们可以从小到达枚举二的次方,最后再加上剩余就可
//这样组成01背包,再用01背包的思路求解
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 11010;
int f[N], v[N], w[N];
int n, m, cnt;
int main()
{
cin >> n >> m;
for(int i = 0; i <= m; i ++) f[i] = 0;
for(int i = 1; i <= n; i ++)
{
int a, b, c;
cin >> a >> b >> c;
for(int k = 1; k <= c; k *= 2)
{
v[++cnt] = k*a;
w[cnt] = k*b;
c -= k;
}
if(c)
{
v[++cnt] = c*a;
w[cnt] = c*b;
}
}
for(int i = 1; i <= cnt; i ++)
{
for(int j = m; j >= v[i]; j --)
{
f[j] = max(f[j], f[j-v[i]] + w[i]);
}
}
cout << f[m] << endl;
return 0;
}
//单调队列优化代码
//二维朴素版
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 2e4 + 10;
int n, m;
int w[N], v[N], s[N];
int q[N], f[N][N];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i] >> s[i];
}
for(int i = 1; i <= n; i ++)
{
for(int r = 0; r < v[i]; r ++)
{
int hh = 0, tt = -1;
for(int j = r; j <= m; j += v[i])
{
while(hh <= tt && j - q[hh] > v[i] * s[i]) hh ++;
while(hh <= tt && f[i-1][q[tt]] + (j - q[tt])/v[i] * w[i] <= f[i-1][j]) tt --;
q[++tt] = j;
f[i][j] = f[i-1][q[hh]] + (j - q[hh])/v[i] * w[i];
}
}
}
cout << f[n][m] << endl;
return 0;
}
//一维单调队列优化版本
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 2e4 + 10;
int n, m;
int w[N], v[N], s[N];
int q[N], f[N], g[N];
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> v[i] >> w[i] >> s[i];
}
for(int i = 1; i <= n; i ++)
{
memcpy(g, f, sizeof(g));
//相当于存了一下f[i-1]的所有状态
for(int r = 0; r < v[i]; r ++)
{
int hh = 0, tt = -1;
//如果想像01背包那样优化就得倒着枚举体积了,更麻烦
for(int j = r; j <= m; j += v[i])
{
while(hh <= tt && j - q[hh] > v[i] * s[i]) hh ++;
while(hh <= tt && g[q[tt]] + (j - q[tt])/v[i] * w[i] <= g[j]) tt --;
q[++tt] = j;
f[j] = g[q[hh]] + (j - q[hh])/v[i] * w[i];
}
}
}
cout << f[m] << endl;
return 0;
}
分组背包
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e2 + 10;
int v[N][N], w[N][N], s[N], f[N];
int n, m;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i ++)
{
cin >> s[i];
for(int j = 1; j <= s[i]; j ++)
{
cin >> v[i][j] >> w[i][j];
}
}
for(int i = 1; i <= n; i ++)
{
for(int j = m; j >= 0; j --)
{
for(int k = 0; k <= s[i]; k ++)
{
if(j >= v[i][k])
f[j] = max(f[j], f[j-v[i][k]] + w[i][k]);
}
}
}
cout << f[m] << endl;
return 0;
}