【POJ 2392 Space Elevator 】 多重背包

POJ 2392
这个和多重背包的区别就是还有个高度限制
那么你按照高度从小到大排序 然后让所有可以到达的状态是由之前状态推出来
优先用小高度限制的块去堆
然后输出答案即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);

/*namespace sgt
{
    #define mid ((l+r)>>1)

    #undef mid
}*/
const int MAX_N = 405;
struct node
{
    int h,a,c;
    bool operator <(const node other) const
    {
        return a < other.a;
    }
}arr[MAX_N];
int f[40025],cnt[40025];
int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n,ans = 0;
    scanf("%d",&n);
    for(int i = 1;i<=n;++i) scanf("%d%d%d",&arr[i].h,&arr[i].a,&arr[i].c);
    sort(arr+1,arr+1+n);
    f[0] = 1;
    for(int i = 1;i<=n;++i)
    {
        memset(cnt,0,sizeof(cnt));
        for(int j = arr[i].h;j<=arr[i].a;j++)
        {
            if(!f[j]&&f[j-arr[i].h]&&cnt[j-arr[i].h]+1<=arr[i].c)
            {
                f[j] = 1;
                cnt[j] = cnt[j-arr[i].h]+1;
                if(ans<j) ans = j;
            }
        }
    }
    printf("%d\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}