hdu1069（dp）

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#define LL long long
using namespace std;
int dp[200];
struct node
{
    int x,y,z;
}s[200];
int cmp(node a,node b)
{
    if(a.x!=b.x)return a.x>b.x;
    else if(a.y!=b.y)return a.y>b.y;
    else return a.z>b.z;
}
int main()
{
    int n,cas=1;
    while(scanf("%d",&n)&&n)
    {
        int tot=1;
        for(int i=1;i<=n;i++)
        {
            int x,y,z;
            scanf("%d%d%d",&x,&y,&z);
            s[tot].x=x;s[tot].y=y;s[tot].z=z;
            tot++;
            s[tot].x=x;s[tot].y=z;s[tot].z=y;
            tot++;
            s[tot].x=y;s[tot].y=x;s[tot].z=z;
            tot++;
            s[tot].x=y;s[tot].y=z;s[tot].z=x;
            tot++;
            s[tot].x=z;s[tot].y=y;s[tot].z=x;
            tot++;
            s[tot].x=z;s[tot].y=x;s[tot].z=y;
            tot++;
        }
        sort(s+1,s+tot,cmp);
        memset(dp,0,sizeof(dp));
        dp[1]=s[1].z;
        int ans=-1;
        for(int i=2;i<tot;i++)
        {//printf("%d %d %d\n",s[i].x,s[i].y,s[i].z);
            int mx=0;
            for(int j=1;j<i;j++)
                if(s[j].x>s[i].x&&s[j].y>s[i].y&&dp[j]+s[i].z>mx)mx=dp[j]+s[i].z;
            if(mx==0)dp[i]=s[i].z;
            else
            dp[i]=mx;
            ans=max(mx,ans);
        }
        printf("Case %d: maximum height = %d\n",cas++,ans);
    }
}