bzoj1222: [HNOI2001]产品加工

注意时间都是 <= 5的。。

 #include<cstdio>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<iostream>

 using namespace std;

 template<typename Q> Q read(Q& x) {
     static char c, f;
     for(f = ; c = getchar(), !isdigit(c); ) if(c == '-') f = ;
     for(x = ; isdigit(c); c = getchar()) x = x *  + c - '';
     if(f) x = -x;
     return x;
 }
 template<typename Q> Q read() {
     static Q x; read(x); return x;
 }

 const int N =  + , INF =  *  + ;
 int a[N], b[N], c[N];
 int f[N * ];

 int main() {
 #ifdef DEBUG
     freopen("in.txt", "r", stdin);
     freopen("out.txt", "w", stdout);
 #endif

     int n, maxw = ;
     scanf("%d", &n);
     for(int i = ; i <= n; i++) {
         scanf("%d%d%d", a + i, b + i, c + i);
         if(!a[i]) a[i] = INF;
         if(!b[i]) b[i] = INF;
         if(!c[i]) c[i] = INF;
         maxw += min(min(a[i], b[i]), c[i]);
     }
     memset(f, 0x3f, sizeof f);
     f[] = ;
     for(int i = ; i <= n; i++) {
         for(int j = maxw; j >= ; j--) {
             f[j] += b[i];
             if(j >= a[i]) f[j] = min(f[j], f[j - a[i]]);
             if(j >= c[i]) f[j] = min(f[j], f[j - c[i]] + c[i]);
         }
     }
     int ans = INF;
     for(int i = ; i <= maxw; i++) ans = min(ans, max(i, f[i]));
     printf("%d\n", ans);

     return ;
 }