一维二进制优化 时间复杂度nlog(s)
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 12010, M = 2010;
int n, m;
int v[N], w[N];
int f[M];
int main()
{
cin >> n >> m;
int cnt = 0;
for (int i = 1; i <= n; i ++ )
{
int value, worth, quantity;
cin >> value >> worth >> quantity;
int k=1;
while(k<quantity)
{
cnt++;
v[cnt]=k*value;
w[cnt]=k*worth;
quantity-=k;
k*=2;
}
if(quantity>0)
{
cnt++;
v[cnt]=quantity*value;
w[cnt]=quantity*worth;
}
}
n=cnt;
for(int i=1;i<=n;i++)
{
for(int j=m;j>=v[i];j--)
{
f[j]=max(f[j],f[j-v[i]]+w[i]);
}
}
cout<<f[m];
return 0;
}