【HDOJ】1881 毕业bg

01背包。

#include <cstdio>
#include <cstring>
#include <cstdlib>

#define MAXN 1005

typedef struct {
    int h, l, t;
} node_st;

node_st nodes[35];

int dp[MAXN];

int comp(const void *a, const void *b) {
    node_st *p = (node_st *)a;
    node_st *q = (node_st *)b;
    return p->t-q->t;
}

int main() {
    int n, max;
    int i, j, tmp;

    while (scanf("%d",&n)!=EOF && (n>=0)) {
        max = 0;
        for (i=1; i<=n; ++i) {
            scanf("%d%d%d", &nodes[i].h,&nodes[i].l,&nodes[i].t);
            if (nodes[i].t > max) max = nodes[i].t;
        }
        qsort(nodes+1, n, sizeof(node_st), comp);
        memset(dp, 0, sizeof(dp));
        for (i=1; i<=n; ++i) {
            for (j=nodes[i].t-nodes[i].l; j>=0; --j) {
                tmp = dp[j] + nodes[i].h;
                if (dp[j+nodes[i].l] < tmp)
                    dp[j+nodes[i].l] = tmp;
            }
        }
        n = 0;
        for (i=1; i<=max; ++i)
            if (dp[i] > n)
                n = dp[i];
        printf("%d
", n);
    }

    return 0;
}