HDU 4001 To Miss Our Children Time dp

戳这里：HDU 4001

//题意：有三种积木，第0种 只能放在长和宽都严格小于它的积木上，第1种 只能放在长和宽都小于等于它 且 面积小于它的积木上，第2种 只能放在长和宽都小于等于它的积木上，dp 求积木的最高高度。

#include "bits/stdc++.h"
using namespace std;
int n;
struct Block
{
    int a, b, c, d;
}block[1010];
bool cmp(Block A, Block B)
{
    if(A.a != B.a) {
        return A.a < B.a;
    }
    if(A.b != B.b) {
        return A.b < B.b;
    }
    return A.d > B.d;
}

long long dp[1010];

int main()
{
    while(scanf("%d", &n) && n) {
        memset(dp, 0, sizeof(dp));
        int i;
        for(i = 1; i <= n; ++i) {
            scanf("%d%d%d%d", &block[i].a, &block[i].b, &block[i].c, &block[i].d);
            if(block[i].a > block[i].b) {
                swap(block[i].a, block[i].b);
            }
        }
        sort(block + 1, block + 1 + n, cmp);
        int j;
        for(i = 1; i <= n; ++i) {
            for(j = 0; j < i; ++j) {
                if(block[i].d == 0) {
                    if(block[j].a <= block[i].a && block[j].b <= block[i].b) {
                        dp[i] = max(dp[i], dp[j] + block[i].c);
                    }
                }
                if(block[i].d == 1) {
                    if((block[j].a <= block[i].a && block[j].b < block[i].b) || (block[j].a < block[i].a && block[j].b <= block[i].b)) {
                        dp[i] = max(dp[i], dp[j] + block[i].c);
                    }
                }
                if(block[i].d == 2) {
                    if(block[j].a < block[i].a && block[j].b < block[i].b) {
                        dp[i] = max(dp[i], dp[j] + block[i].c);
                    }
                }
            }
        }
        long long res = 0;
        for(i = 1; i <= n; ++i) {
            res = max(res, dp[i]);
        }
        printf("%I64d
", res);
    }
}