多重背包的题目,不过有些些许的变形,背包容量在随时变化,加个判断就行,属于比较简单的~~
但是WA了好几次~~,愁
贴个代码吧
#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=410;
struct Node
{
int h,c;
int lim;
}node[MAXN];
bool dp[50000];
int H;
int ans;
void ZeroOnePack(int cost,int lim)
{
for(int i=lim;i>=cost;i--)
if(dp[i-cost]&&(!dp[i]))
{
dp[i]=true;
ans=max(ans,i);
}
}
void CompletePack(int cost,int lim)
{
for(int i=cost;i<=lim;i++)
if(dp[i-cost]&&(!dp[i]))
{
dp[i]=true;
ans=max(ans,i);
}
}
void MultiplePack(int cost,int amount,int lim)
{
if(cost*amount>=lim)CompletePack(cost,lim);
else
{
for(int k=1;k<amount;)
{
ZeroOnePack(k*cost,lim);
amount-=k;
k<<=1;
}
ZeroOnePack(amount*cost,lim);
}
}
bool cmp(Node a,Node b)
{
return a.lim<b.lim;
}
int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int n;
while(scanf("%d",&n)!=EOF)
{
H=0;
for(int i=0;i<n;i++)
{
scanf("%d%d%d",&node[i].h,&node[i].lim,&node[i].c);
if(node[i].lim>H)H=node[i].lim;
}
for(int i=0;i<=H;i++)dp[i]=false;
dp[0]=true;
sort(node,node+n,cmp);
ans=0;
for(int i=0;i<n;i++)
MultiplePack(node[i].h,node[i].c,node[i].lim);
printf("%d\n",ans);
}
return 0;
}