http://acm.hdu.edu.cn/showproblem.php?pid=1069
先排序 然后类似 最大上升子序列的 求法
代码:
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
using namespace std;
struct blocks
{
int x,y,z;
}k[1005];
bool cmp (blocks a,blocks b)
{
if(a.x==b.x)
return a.y<b.y;
else
return a.x<b.x;
}
int main()
{
int n;
int T=1;
while(scanf("%d",&n),n)
{
int i,j;
for(i=1,j=1;i<=n;i++)
{
int x,y,z;
scanf("%d%d%d",&x,&y,&z);
k[j].x=x,k[j].y=y,k[j].z=z;
j++;
k[j].x=x,k[j].y=z,k[j].z=y;
j++;
k[j].x=y,k[j].y=x,k[j].z=z;
j++;
k[j].x=z,k[j].y=x,k[j].z=y;
j++;
k[j].x=z,k[j].y=y,k[j].z=x;
j++;
k[j].x=y,k[j].y=z,k[j].z=x;
j++;
}
sort(k+1,k+j,cmp);
for( i=2;i<j;i++)
{
int maxn=k[i].z;;
for(int m=1;m<i;m++)
{
if(k[i].x>k[m].x&&k[i].y>k[m].y)
maxn=max(k[i].z+k[m].z,maxn);
}
k[i].z=maxn;
}
int nummax=-1;
for( i=1;i<j;i++)
{
if(k[i].z>nummax)
nummax=k[i].z;
}
printf("Case %d: maximum height = %d\n",T++,nummax);
}
}