HDU 1069 —— Monkey and Banana

原题：http://acm.hdu.edu.cn/showproblem.php?pid=1069

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn = 1100;
int n;
int dp[maxn];
int T = 0;

struct node
{
	int x, y, z;
	
	friend bool operator < (const node a, const node b)
	{
		if(a.x != b.x)	return a.x < b.x;
		else return a.y < b.y;
	}
	
}p[maxn];

int main()
{
	while(~scanf("%d", &n))
	{
		if(n == 0)	break;
		int cnt = 0;
		for(int i = 1;i<=n;i++)
		{
			int xi, yi, zi;
			scanf("%d%d%d", &xi, &yi, &zi);
			p[cnt].z = xi, p[cnt].x = yi, p[cnt].y = zi;
			cnt++;
			p[cnt].z = xi, p[cnt].x = zi, p[cnt].y = yi;
			cnt++;
			p[cnt].z = yi, p[cnt].x = xi, p[cnt].y = zi;
			cnt++;
			p[cnt].z = yi, p[cnt].x = zi, p[cnt].y = xi;
			cnt++;
			p[cnt].z = zi, p[cnt].x = xi, p[cnt].y = yi;
			cnt++;
			p[cnt].z = zi, p[cnt].x = yi, p[cnt].y = xi;
			cnt++;
		}
		sort(p, p+cnt);
		for(int i = 0;i<cnt;i++)	dp[i] = p[i].z;
		int ans = -1;
		for(int i = 1;i<cnt;i++)
		{
			for(int j = 0;j<i;j++)
			{
				if(p[i].x > p[j].x && p[i].y > p[j].y && dp[i] < dp[j] + p[i].z)
					dp[i] = dp[j] + p[i].z;
				if(ans < dp[i])
					ans = dp[i];
			}
		}
		printf("Case %d: maximum height = %d\n", ++T, ans);
	}
	return 0;
}