题目分析:
- 将一个物品有多个拆分为1个,2个,4个,8个…打包的形式,然后01背包即可
Code:
#include <bits/stdc++.h>
using namespace std;
#define maxn 5100000
#define maxv 5100000
int n,v,cnt=0,w[maxn],c[maxn],f[maxv];
inline void init_() {
freopen("a.txt","r",stdin);
}
inline int read_() {
int x=0,f=1;
char c=getchar();
while(c<'0'||c>'9') {
if(c=='-') f=-1;
c=getchar();
}
while(c>='0'&&c<='9') {
x=(x<<3)+(x<<1)+c-'0';
c=getchar();
}
return x*f;
}
void readda_() {
n=read_();v=read_();
int x,y,z;
for(int i=1;i<=n;++i) {
int t=1;
x=read_();y=read_();z=read_();
while(z>=t) {
w[++cnt]=x*t;
c[cnt]=y*t;
z-=t;
t*=2;
}
w[++cnt]=x*z;
c[cnt]=y*z;
}
memset(f,0,sizeof(f));
for(int i=1;i<=cnt;++i) {
for(int j=v;j>=c[i];--j) {
f[j]=max(f[j],f[j-c[i]]+w[i]);
}
}
printf("%d",f[v]);
}
int main() {
init_();
readda_();
return 0;
}