uva 437 dp

UVA 437 - The Tower of Babylon

给了一堆a*b*c的石头，求最高能堆多高，石头使用不限次数。
每个石头可以视为6个石头，对其底面大小进行排序，然后类似最长上升子序列的做法。

#include <bits/stdc++.h>
using namespace std;

struct Node {
    int a, b, c;
    Node(){}
    Node(int _a, int _b, int _c) {
        a = _a; b = _b; c = _c;
    }
}p[305];


int n, k;
int dp[305];

bool cmp (Node a, Node b) {
    if (a.a == b.a) return a.b > b.b;
    else return a.a > b.a;
}

bool _judge(Node a, Node b) {
    if (a.a > b.a && a.b > b.b) return true;
    else return false;
} 

int main () {
    for (int cases = 1; scanf("%d", &n) == 1 && n!=0; ++cases) {
        k = 0;
        int a, b, c;

        for (int i=1; i<=n; i++) {
            scanf ("%d%d%d", &a, &b, &c);
            p[k++] = Node(a, b, c);
            p[k++] = Node(a, c, b);
            p[k++] = Node(b, a, c);
            p[k++] = Node(b, c, a);
            p[k++] = Node(c, a, b);
            p[k++] = Node(c, b, a);
        }

        sort(p, p+k, cmp);

        // for (int i=0; i<k; i++) {
        //  cout << p[i].a << " " << p[i].b << " " << p[i].c << endl;
        // }

        memset(dp, 0, sizeof(dp));
        dp[0] = p[0].c;
        int ans = p[0].c;

        for (int i=1; i<k; i++) {
            dp[i] = p[i].c;
            for (int j=0; j<i; j++) {
                if(_judge(p[j], p[i])) {
                    dp[i] = max(dp[i], dp[j]+p[i].c);
                }
            }
            ans = max(ans, dp[i]);
        }

        printf("Case %d: maximum height = %d\n", cases, ans);
    }
    return 0;
}