AcWing 9. 分组背包问题
原题链接
中等
// 二维
//状态转移方程如果用到上一层 则j从大到小枚举, 用到本层则从小到大枚举
# include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, m;
int v[N][N], w[N][N], s[N];
int f[N][N];
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 = 0 ; j <= m; j++)
{
f[i][j] = f[i-1][j];
for(int k = 1; k <= s[i]; k++)
if(j >= v[i][k]) f[i][j] = max(f[i][j], f[i-1][j- v[i][k]] + w[i][k]);
}
cout << f[n][m] << endl;
return 0;
}
//一维
# include <bits/stdc++.h>
using namespace std;
const int N = 110;
int n, m;
int v[N][N], w[N][N], s[N];
int f[N];
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 = 1; 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;
}