poj 2392

多重背包问题，这里还要先排序一下，要把限高高度小的放前面，这样子才能将所有的电梯都充分利用起来，如果把高度小的放后面就会造成无法利用。
这里对于每个电梯来说，它们的背包上限就是它们的限高高度。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,q;
#define M 1110
#define N 100010
#define Mod 1000000000
#define p(x,y) make_pair(x,y)
const int MAX_len=550;
int dp[500010];
struct Node{
    int h,a,c;
    bool operator <(const Node &x)const{
        return a<x.a;
    }
}e[410];
void CompletePack(int cost,int al){
    for(int v=cost;v<=al;v++)
        dp[v] |= dp[v-cost];
}
void ZeroOnePack(int cost,int al){
    for(int v=al;v>=cost;v--)
        dp[v] |= dp[v-cost];
}
void Deal(int v,int w,int al){
    if(v*w>=al){
        CompletePack(v,al);
    }else{
        int k=1;
        while(k<w){
            ZeroOnePack(k*v,al);
            w -= k;
            k *= 2;
        }
        ZeroOnePack(w*v,al);
    }
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
#endif
    while(sf(n)!=EOF){
        int mmax=0;
        for(int i=0;i<n;i++){
            scanf("%d%d%d",&e[i].h,&e[i].a,&e[i].c);
            mmax = Max(mmax,e[i].a);
        }
        sort(e,e+n);
        memset(dp,0,sizeof dp);
        dp[0]=1;
        for(int i=0;i<n;i++)
             Deal(e[i].h,e[i].c,e[i].a);
        while(mmax>=0 && dp[mmax]==0)mmax--;
        printf("%d\n",mmax);
    }
    return 0;
}

此题的写法还有一种叫做 dp染色法，这跟之前做的一道银币拼某种面值的写法是一样的。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll __int64
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,q;
#define M 1110
#define N 100010
#define Mod 1000000000
#define p(x,y) make_pair(x,y)
const int MAX_len=550;
int dp[500010];
int used[500010];
struct Node{
    int h,a,c;
    bool operator <(const Node &x)const{
        return a<x.a;
    }
}e[410];
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
//  freopen("out.txt", "w", stdout);
#endif
    while(sf(n)!=EOF){
        int mmax=0;
        for(int i=0;i<n;i++){
            scanf("%d%d%d",&e[i].h,&e[i].a,&e[i].c);
            mmax = Max(mmax,e[i].a);
        }
        sort(e,e+n);
        memset(dp,0,sizeof dp);
        dp[0]=1;
        for(int i=0;i<n;i++){
            memset(used,0,sizeof used);
            for(int j=e[i].h;j<=e[i].a;j++){
                if(dp[j-e[i].h] && !dp[j] && used[j-e[i].h]+1<=e[i].c){
                    dp[j]=1;
                    used[j] = used[j-e[i].h]+1;
                }
            }
        }
        while(mmax>=0 && dp[mmax]==0)mmax--;
        pf(mmax);
    }
    return 0;
}