第一次见这么长的题目……
多重背包,可以说背包九讲的模版题。
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <algorithm>
using namespace std;
int v;
int dp[105],p[105],h[105],c[105];
void ZeroOnePack(int cost,int weight)
{
for(int i=v;i>=cost;i--)
dp[i]=max(dp[i],dp[i-cost]+weight);
}
void CompletePack(int cost,int weight)
{
for(int i=cost;i<=v;i++)
dp[i]=max(dp[i],dp[i-cost]+weight);
}
void MultipliesPack(int cost,int weight,int amount)
{
if(cost*amount>=v)CompletePack(cost,weight);
else
{
for(int k=1;k<amount;)
{
ZeroOnePack(k*cost,k*weight);
amount-=k;
k<<=1;
}
ZeroOnePack(amount*cost,amount*weight);
}
}
int main()
{
int t,m;
scanf("%d",&t);
while(t--)
{
memset(dp,0,sizeof(dp));
scanf("%d%d",&v,&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d",&p[i],&h[i],&c[i]);
MultipliesPack(p[i],h[i],c[i]);
}
printf("%d\n",dp[v]);
}
return 0;
}