一、题目链接
二、题目分析
(一)算法标签
背包问题 DP
(二)解题思路
三、AC代码
解法一:
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 110;
int n, m;
int v[N], w[N], s[N];
// f[i][j]表示从前i个物品中选,总体积不超过j的方案的最大价值
// 集合划分:第i个物品选0~s[i]个
int f[N][N];
int main()
{
cin >> n >> m;
for (int i = 1; i <= n; i ++ )
scanf("%d%d%d", &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] && k * v[i] <= j; 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;
}