多重背包问题 I（ 背包问题 + dp ）

 输入样例

4 5
1 2 3
2 4 1
3 4 3
4 5 2

输出样例：

10

 

 

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int f[N][N];
int n, m;
int w[N], v[N], s[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 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 - v[i] * k] + k * w[i]);
            }
        }
    }
    cout << f[n][m] << endl;
    return 0;
}

改为01背包来写 

#include<bits/stdc++.h>
using namespace std;
const int N = 110;
int n, m;
int f[N];
int main(){
    cin >> n >> m;
    while(n -- ){
        int v, w, s;
        cin >> v >> w >> s;
        while(s -- ){
            for(int i = m; i >= v; i -- ){
                f[i] = max(f[i], f[i - v] + w);
            }
        }
    }
    cout << f[m] << endl;
    return 0;
}