HDU 1069 Monkey and Banana

参考：https://blog.csdn.net/wust_zjx/article/details/40160797

https://blog.csdn.net/a1dark/article/details/12226353

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
const int N=500;
struct node//积木的结构体
{
    int x,y,z;//长。宽，高
}no[N];
int dp[N];//以第i块为顶的最大高度
int t;
typedef struct node pnode;
bool cmp(pnode x,pnode y)
{
    if (x.x>y.x)
    {
        return true;
    }
    else if(x.x==y.x&&x.y>y.y)
    {
        return true;
    }
    else
    {
        return false;
    }
}
int main()
{
    int n,ca=1;
    while (cin>>n,n)
    {
        int x,y,z;
        t=0;
        for (int i=0;i<n;i++)
        {
            cin>>x>>y>>z;//每组值有6种组合
            no[t].x=x,no[t].y=y,no[t++].z=z;
            no[t].x=y,no[t].y=x,no[t++].z=z;
            no[t].x=x,no[t].y=z,no[t++].z=y;
            no[t].x=z,no[t].y=x,no[t++].z=y;
            no[t].x=y,no[t].y=z,no[t++].z=x;
            no[t].x=z,no[t].y=y,no[t++].z=x;
        }
        sort(no,no+t,cmp);
        memset(dp,0,sizeof(dp));
        for (int i=0;i<t;i++)
        {
            dp[i]=no[i].z;
        }
        for (int i=0;i<t;i++)
        {
            for (int j=0;j<=i;j++)
            {
                if (no[j].x>no[i].x&&no[j].y>no[i].y&&dp[j]+no[i].z>dp[i])//注意i,j不要写错！
                {
                    dp[i]=dp[j]+no[i].z;
                }
            }
        }
        int ans=0;
        for (int i=0;i<t;i++)
        {
            ans=max(ans,dp[i]);
        }
        cout<<"Case "<<ca++<<": maximum height = "<<ans<<endl;
    }

    return 0;
}