HDU4001To Miss Our Children Time【dp】

大意：有三种长方体木块，只有满足如下关系一个木块才可以放在另一个的上面

We describe each block's shape is Cuboid using four integers ai, bi, ci, di. ai, bi are two edges of the block one of them is length the other is width. ci is thickness of the block. We know that the ci must be vertical with earth ground. di describe the kind of the block. When di = 0 the block's length and width must be more or equal to the block's length and width which lies under the block. When di = 1 the block's length and width must be more or equal to the block's length which lies under the block and width and the block's area must be more than the block's area which lies under the block. When di = 2 the block length and width must be more than the block's length and width which lies under the block. Here are some blocks.

问最大高度

分析  因为l和w都是一次递增的  所以只要把其排好序那么就可以dp了  后面的只会被前面的状态所决定

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const long long maxn = 1005;

struct Node {
    long long l, w, h, d;
}node[maxn];
long long dp[maxn];
bool cmp(Node n1, Node n2) {
    if(n1.l != n2.l) return n1.l < n2.l;
    else if(n1.w != n2.w) return n1.w < n2.w;
    return n1.d > n2.d;
}

int main() {
    long long n;
    while(scanf("%I64d",&n) ) {
        if(n == 0) break;
        memset(dp, 0, sizeof(dp));
        for(long long i = 1; i <= n; i++) {
            scanf("%I64d %I64d %I64d %I64d",&node[i].l, &node[i].w, &node[i].h, &node[i].d);
            if(node[i].l < node[i].w) swap(node[i].l, node[i].w);
        }
        sort(node + 1, node + 1 + n, cmp);
        for(long long i = 1; i <= n; i++) {
            dp[i] = node[i].h;
        }
        for(long long i = 1; i <= n; i++) {
            for(long long j = 1; j < i; j++) {
                if(node[i].d == 0) {
                    if(node[i].l >= node[j].l && node[i].w >= node[j].w) {
                        dp[i] = max(dp[i], dp[j] + node[i].h);
                    } 
                } else if(node[i].d == 1) {
                    if((node[i].l >= node[j].l && node[i].w > node[j].w) || (node[i].l > node[j].l && node[i].w >= node[j].w)) {
                        dp[i] = max(dp[i], dp[j] + node[i].h);
                    }
                } else {
                    if(node[i].l > node[j].l && node[i].w > node[j].w) {
                        dp[i] = max(dp[i], dp[j] + node[i].h);
                    }
                }
            }
        }
        long long ans = 0;
        for(long long i = 1; i <= n; i++) ans = max(ans, dp[i]);
        printf("%I64d
", ans);
    }
    return 0;
}