分析
对于不同的物品有
1.枚举所有可能的体积取值分成m种物品转01背包
2.多重背包转01背包
3.完全背包转01背包
然后裸的01背包可以对了
代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<string>
#include<algorithm>
using namespace std;
int f[201][2501];
int p[201];
int a[201],b[201],c[201];
int n,m;
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
{
scanf("%d%d%d",&p[i],&a[i],&b[i]);
if (p[i]==2) scanf("%d",&c[i]);
}
for (int i=1;i<=n;i++)
{
if (p[i]==1)
for (int j=0;j<=m;j++)
for (int k=0;k<=j;k++)
if (j-k>=0) f[i][j]=max(f[i][j],f[i-1][j-k]+a[i]*k*k-b[i]*k);
if (p[i]==2)
for (int j=0;j<=m;j++)
for (int k=0;k<=c[i];k++)
if (j-k*b[i]>=0) f[i][j]=max(f[i][j],f[i-1][j-k*b[i]]+a[i]*k);
if (p[i]==3)
for (int j=0;j<=m;j++)
for (int k=0;k<=m/b[i];k++)
if (j-k*b[i]>=0) f[i][j]=max(f[i][j],f[i-1][j-k*b[i]]+a[i]*k);
}
int ans=0;
for (int i=1;i<=m;i++)
ans=max(ans,f[n][i]);
printf("%d",ans);
}