多重背包问题I-数据量较小情况
相当于每次划分了s+1个子集(每种物品取0个,1个,2个,…,s个),在这s+1个子集中选一个作为最大值
#include<iostream>
#include<cstdio>
using namespace std;
const int N = 110;
int n,m;
int dp[N][N];
int main(){
cin>>n>>m;
for (int i = 1; i <= n; i++) {
int w, v, s;
cin >> w >> v >> s;
for (int j = 0; j <= m; j++) {
for (int k=0; k<=s && k*w<=j; k++)
dp[i][j] = max(dp[i][j], dp[i - 1][j - k * w] + k * v);
}
}
cout<<dp[n][m]<<endl;
return 0;
}