ACM经典算法

#include <iostream>
#include <algorithm>
using namespace std;

struct cube
{
    int l;
    int w;
    int h;
    int sum;
};
cube a[100];

bool cmp(cube i,cube j)
{
    return i.l * i.w >j.l * j.w;
}
bool isSuit(cube i,cube j)
{
    return i.l<j.l&&i.w<j.w || i.w<j.l&&i.l<j.w;
}
int main()
{
    int n,l,w,h;
    int cnt=1;
    while(cin>>n&&n!=0)
    {
        memset(a,0,sizeof(a));
        for(int i=0;i<3*n;i++)
        {
            cin>>l>>w>>h;
            a[i].l = l;a[i].w = w;a[i].h = h;i++;
            a[i].l = w;a[i].w = h;a[i].h = l;i++;
            a[i].l = h;a[i].w = l;a[i].h = w;
        }
        sort(a,a+3*n,cmp);
     
        a[0].sum = a[0].h;
        for(int i=1;i<3*n;i++)
        {
            int tempMax=0;//注意，这里必须为0
            for(int j=0;j<i;j++)
            {
                if(a[j].sum>tempMax&&isSuit(a[i],a[j]))
                {
                    tempMax = a[j].sum;
                }
            }
            a[i].sum = tempMax + a[i].h;
        }
        int temp = -1;
        for(int i=0;i<3*n;i++)
        {
            if(a[i].sum>temp)
            {
                temp = a[i].sum;
            }
        }
        printf("Case %d: maximum height = %d\n",cnt,temp);
        cnt++;
    }
    return 0;
}