POJ 2392 DP 多重背包

链接：

http://poj.org/problem?id=2392

代码：

#include <map>
#include <set>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define mp make_pair
#define lson l,m,rt<<1  
#define rson m+1,r,rt<<1|1 
typedef long long ll;
typedef vector<int> VI;
typedef pair<int, int> PII;
const ll MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const int MAXN = 4e4 + 7;
// head

struct Block {
    int h, a, c;
    const bool operator<(const Block &t) const {
        return a < t.a;
    }
}a[410];

int dp[MAXN];
int sum[MAXN];

int main() {
    int n;
    cin >> n;
    rep(i, 0, n) scanf("%d%d%d", &a[i].h, &a[i].a, &a[i].c);
    sort(a, a + n);
    dp[0] = 1;
    int ans = 0;
    rep(i, 0, n) {
        memset(sum, 0, sizeof(sum));
        rep(j, a[i].h, a[i].a + 1) if (!dp[j] && dp[j - a[i].h] && sum[j - a[i].h] < a[i].c) {
            dp[j] = 1;
            sum[j] = sum[j - a[i].h] + 1;
            ans = max(ans, j);
        }
    }
    cout << ans << endl;
    return 0;
}