题目:http://acm.hdu.edu.cn/showproblem.php?pid=2191
#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int dp[N], v[N], w[N], num[N];
void ZeroOnePack(int w, int v, int W)
{
for(int i = W; i >= w; i--) dp[i] = max(dp[i], dp[i-w] + v);
}
void CompletePack(int w, int v, int W)
{
for(int i = w; i <= W; i++) dp[i] = max(dp[i], dp[i-w] + v);
}
void MultiplePack(int w, int v, int num, int W)
{
if(w * num >= W) CompletePack(w, v, W);
else
{
int k = 1;
while(k <= num)
{
ZeroOnePack(k * w, k * v, W);
num -= k;
k *= 2;
}
ZeroOnePack(num * w, num * v, W);
}
}
int main()
{
int t, n, m;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &m, &n);
for(int i = 1; i <= n; i++) scanf("%d%d%d", &w[i], &v[i], &num[i]);
memset(dp, 0, sizeof dp);
for(int i = 1; i <= n; i++)
MultiplePack(w[i], v[i], num[i], m);
printf("%d\n", dp[m]);
}
return 0;
}