hdu-2191 悼念512汶川大地震遇难同胞——珍惜现在，感恩生活---多重背包

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=2191

题目大意：
中文题

思路：

裸的多重背包

#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
const int INF = 0x3f3f3f3f;
const int maxn = 200 + 10;
int T, n, m, cases;
int cost[maxn], weight[maxn], amount[maxn], dp[maxn];
void zeroone(int cost, int weight)
{
    for(int i = n; i >= cost; i--)
        dp[i] = max(dp[i], dp[i - cost] + weight);
}
void complete(int cost, int weight)
{
    for(int i = cost; i <= n; i++)
        dp[i] = max(dp[i], dp[i - cost] + weight);
}
void solve(int cost, int weight, int amount)
{
    if(cost * amount >= n)
        complete(cost, weight);
    else
    {
        int k = 1;//二进制优化
        while(k <= amount)
        {
            zeroone(k * cost, k * weight);
            amount -= k;
            k *= 2;
        }
        zeroone(amount * cost, amount * weight);
    }
}
int main()
{
    cin >> T;
    while(T--)
    {
        cin >> n >> m;
        memset(dp, 0, sizeof(dp));
        for(int i = 0; i < m; i++)
            cin >> cost[i] >> weight[i] >> amount[i];
        for(int i = 0; i < m; i++)
            solve(cost[i], weight[i], amount[i]);
        cout<<dp[n]<<endl;
    }
    return 0;
}