hdu 1069 Monkey and Banana

题意：给出长方体的长宽高，问能叠多高（上面一个的底的长宽要严格大于下一个）。

分析：按底面积排序，设dp[i]为第i个能达到的最大高度，则dp[i] = max{dp[j]} + h[i] ; (j<i)

/*
Author:Zhaofa Fang
Lang:C++
*/
#include <cstdio>
#include <cstdlib>
#include <sstream>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>

using namespace std;

typedef long long ll;
#define DEBUG(x) cout<< #x << ':' << x << endl
#define PII pair<int,int>
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define lowbit(x) (x&(-x))
#define INF (1<<30)

struct STONE
{
    int l,w,h;
}s[100];
int dp[100];
bool cmp(STONE x,STONE y)
{
    return x.l*x.w>y.l*y.w;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in","r",stdin);
    #endif
    int n;
    int a,b,c;
    int cas = 0;
    while(~scanf("%d",&n),n)
    {
        int nn=1;
        while(n--)
        {
            scanf("%d%d%d",&a,&b,&c);
            s[nn].l = a;s[nn].w = b;s[nn++].h=c;
            s[nn].l = a;s[nn].w = c;s[nn++].h=b;
            s[nn].l = c;s[nn].w = b;s[nn++].h=a;
        }
        sort(s+1,s+nn+1,cmp);
        for(int i=1;i<nn;i++)
        {
            dp[i] = s[i].h;
            for(int j=1;j<i;j++)
            {
                if((s[i].l<s[j].l && s[i].w<s[j].w) || (s[i].l<s[j].w && s[i].w<s[j].l))
                {
                    dp[i] = max(dp[i],s[i].h + dp[j]);
                }
            }
        }
        int ans = -1;
        for(int i=1;i<nn;i++)
        {
            if(ans < dp[i])ans = dp[i];
        }
        printf("Case %d: maximum height = %d\n",++cas,ans);
    }

    return 0;
}