POJ 1276 混合背包

发现不能按照背包九讲上直接将各种背包封装成函数的方式来写，会RE
对于背包结果存在上限的，直接在转移时加上限制即可

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;

int dp[100001];
int cnt[11]; //number
int D[11]; // denomination
int cash, n;

int main(){
    while(cin >> cash >> n){
        for(int i = 1; i <= n; ++i){
            cin >> cnt[i] >> D[i];
        }
        memset(dp,0,sizeof(dp));
        for(int i = 1; i <= n; ++i){
            if(cnt[i] == 1){
                for(int j = cash; j >= D[i]; --j){
                    if(dp[j-D[i]]+D[i] <= cash)
                    dp[j] = max(dp[j],dp[j-D[i]]+D[i]);
                }
            }
            else if(cnt[i] * D[i] >= cash){
                for(int j = D[i]; j <= cash; ++j){
                    if(dp[j-D[i]]+D[i] <= cash)
                    dp[j] = max(dp[j],dp[j-D[i]]+D[i]);
                }
            }
            else if(cnt[i] > 1){
                int k = 1;
                int m = cnt[i];
                while(k < m){
                    for(int j = cash; j >= k*D[i]; --j){
                    if(dp[j-D[i]]+D[i] <= cash)
                        dp[j] = max(dp[j], dp[j-k*D[i]] + k*D[i]);
                    }
                    m -= k;
                    k *= 2;
                }
                for(int j = cash; j >= m*D[i]; --j){
                    dp[j] = max(dp[j], dp[j-m*D[i]] + m*D[i]);
                }
            }
        }
        cout << dp[cash] << endl;
    }
    return 0;
}