bzoj1222: [HNOI2001]产品加工

#include<cstring>
#include<cmath>
#include<cstdio>
#include<iostream>
#include<cstdlib>
#include<algorithm>
#define inf 0x3f3f3f3f
using namespace std;
int a[6005],b[6005],c[6005],f[30005],n,m,ans,tmp;
int main(){
scanf("%d",&n);
for (int i=1;i<=n;i++){
scanf("%d%d%d",&a[i],&b[i],&c[i]);
if (!a[i]) a[i]=inf;
if
4000
(!b[i]) b[i]=inf;
if (!c[i]) c[i]=inf;
m+=min(a[i],min(b[i],c[i]));
}
for (int i=1;i<=n;i++)
for (int j=m;j>=0;j--){
tmp=inf;
if (j>=a[i]) tmp=min(tmp,f[j-a[i]]);
tmp=min(tmp,f[j]+b[i]);
if (j>=c[i]) tmp=min(tmp,f[j-c[i]]+c[i]);
f[j]=tmp;
}
ans=inf;
for (int i=0;i<=m;i++) ans=min(ans,max(f[i],i));
printf("%d",ans);
}