一本通 1269：【例9.13】庆功会

庆功会

多重背包模板

比01背包多了一个将某种物品拆分的过程。

#include 
#include 
using namespace std;
//Mystery_Sky
//
#define M 10000
int c[M], w[M], num[M];
int f[M], new_c[M], new_w[M];
int v, m, tot;
int main() {
    scanf("%d%d", &m, &v);
    for(int i = 1; i <= m; i++) scanf("%d%d%d", &c[i], &w[i], &num[i]);
    for(int i = 1; i <= m; i++) {
        for(int j = 1; j <= num[i]; j <<= 1) {
            num[i] -= j;
            new_c[++tot] = c[i] * j;
            new_w[tot] = w[i] * j;
        }
        if(num[i]) {
            new_c[++tot] = c[i] * num[i];
            new_w[tot] = w[i] * num[i];
            num[i] = 0;
        }
    }
    for(int i = 1; i <= tot; i++) 
        for(int j = v; j >= new_c[i]; j--)
            f[j] = max(f[j], f[j-new_c[i]]+new_w[i]);
    printf("%d\n", f[v]);
    return 0;
}

转载于:https://www.cnblogs.com/Benjamin-cpp/p/10846558.html