zoj 1093 Monkey and Banana

#include<cstdio>
#include<algorithm>
#define MAX 30
using namespace std;

typedef struct {

int a,b,h;

}Block;
Block block[MAX*3];
int h[MAX*3];
int cmp(const Block &B1,const Block &B2){

if(B1.a==B2.a)
return B1.b<B2.b;
return B1.a<B2.a;

}

int main(){
int a,b,c;
int num;
int cas=1;
while(scanf("%d",&num),num)
{

int i,j;
int index=0;
int side[3];
for(i=0; i<num; i++)
{

scanf("%d %d %d",&side[0],&side[1],&side[2]);
sort(side,side+3);

block[index].a=side[2],block[index].b=side[1],block[index].h=side[0];

index++;

block[index].a=side[2],block[index].b=side[0],block[index].h=side[1];
index++;
block[index].a=side[1],block[index].b=side[0],block[index].h=side[2];
index++;
}
sort(block,block+index,cmp);

int best=h[index-1]=block[index-1].h;
for(i=index-2; i>=0; i--)
{
h[i]=0;
for(j=i+1; j<index; j++)
{

if(block[i].a<block[j].a&&block[i].b<block[j].b&&h[i]<h[j])
{
h[i]=h[j];
}

}
h[i]+=block[i].h;
if(h[i]>best)best=h[i];
}

printf("Case %d: maximum height = %d\n",cas++,best);
}

return 0;
}