Space Elevator POJ

题目传送门

题意：给你n种高塔，每一种高塔都有自己的高度，数量，以及这种高塔组稿不能超过的高度，问你能搭建成的最高的高度。

思路：按照高塔的限制高度进行一个排序，然后多重背包就好了。

#include <algorithm>#include <cmath>#include <cstdio>#include <cstring>#include <iostream>#include <list>#include <map>#include <queue>#include <set>#include <stack>#include <string>#include <vector>#define MAXN 100100#define MAXE 100#define INF 100000000#define MOD 10001#define LL long long#define ULL unsigned long long#define pi 3.14159using namespace std;struct Node {    int h;    int a;    int c;}p[MAXN];bool cmp(const Node &x1, const Node &x2) {    return x1.a < x2.a;}int vis[MAXN];bool dp[MAXN];int main() {    std::ios::sync_with_stdio(false);    int n;    cin >> n;    int max_height = 0;    for (int i = 1; i <= n; ++i) {        cin >> p[i].h >> p[i].a >> p[i].c;        max_height = max(max_height, p[i].a);    }    sort(p + 1, p + 1 + n, cmp);    memset(dp, false, sizeof(dp));    dp[0] = true;    for (int i = 1; i <= n; ++i) {        memset(vis, 0, sizeof(vis));        for (int j = p[i].h; j <= p[i].a; ++j) {            if (!dp[j] && dp[j - p[i].h] && vis[j - p[i].h] < p[i].c) {                dp[j] = true;                vis[j] = vis[j - p[i].h] + 1;            }        }    }    for (int i = max_height; i >= 0; --i) {        if (dp[i]) {            cout << i << endl;            break;        }    }    return 0;}/* */