思路:
二进制优化多重背包,刚好瞅个模板,啦啦啦~
代码:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int Max_n=110;
const int Max_m=1e5+10;
int n,W;
int w[Max_n],v[Max_n],c[Max_n]; //重量、价值和数量
int dp[Max_m];
void ZeroOne_Pack(int w,int v){
for(int i=W;i>=w;i--)
dp[i]=max(dp[i],dp[i-w]+v);
}
void Complete_Pack(int w,int v){
for(int i=w;i<=W;i++)
dp[i]=max(dp[i],dp[i-w]+v);
}
int Multi_Pack(){
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++){
if(w[i]*c[i]>=W)Complete_Pack(w[i],v[i]);
else {
int k=1;
while(k<c[i]){
ZeroOne_Pack(w[i]*k,v[i]*k);
c[i]-=k;
k<<=1;
}
ZeroOne_Pack(w[i]*c[i],v[i]*c[i]);
}
}
return dp[W];
}
int main()
{
scanf("%d%d",&n,&W);
for(int i=0;i<n;i++)
scanf("%d%d%d",&w[i],&v[i],&c[i]);
printf("%d\n",Multi_Pack());
return 0;
}