01背包 完全背包 多重背包模板

const int maxn = 100000 + 10;int N, V, amount[maxn], capacity[maxn], weight[maxn];int dp[maxn];void bag01(int cost, int weight) {    for (int i = V; i >= cost; i--) {        dp[i] = max(dp[i], dp[i - cost] + weight);    }}void completebag(int cost, int weight) {    for (int i = cost; i <= V; i++) {        dp[i] = max(dp[i], dp[i - cost] + weight);    }}void multiplybag(int cost, int weight, int amount) {    if (cost * amount >= V) completebag(cost, weight);    else {        int k = 1;        while (k < amount) {            bag01(k * cost, k * weight);            amount -= k;            k += k;        }        bag01(amount * cost, amount * weight);    }} 

关于单调队列优化多重背包请看http://blog.csdn.net/hao_zong_yin/article/details/72457425