01,完全,多重,分组

模板

void zero(int weight){
    for(int i=1000;i>=weight;i--){
        if(dp[i-weight])
            dp[i] = 1;
    }
}

void comp(int weight){
    for(int i=weight;i<=1000;i++){
        if(dp[i-weight])
            dp[i] = 1;
    }
}

void dpppp(int weight,int ct){
    if(weight * ct >= 1000){
        comp(weight);
        return;
    }
    int t=1;
    while(t<ct){
        zero(t*weight);
        ct -= t;
        t*=2;
    }
    zero(ct*weight);
}

 for(int k=1;k<=n;k++){
        for(int i=m;i>=0;i--){
            for(int j=0;j<c[k].size();j++){
                if(i - c[k][j] >= 0){
                    if(dp[i] <= dp[i-c[k][j]]+w[k][j]){
                        dp[i] = dp[i-c[k][j]]+w[k][j];
                        path[k][i] = j + 1;
                    }
                }
            }
        }
    }