hdu 1069 Monkey and Banana 最长上升子序列。

#include<stdio.h>
#include<string.h>
#include<algorithm>

using namespace std;

int dp[200];

struct node{
	int a, b, c;
}p[200];

bool cmp( node q, node w )
{
	if( q.a > w.a )
		return 1;
	if( q.a == w.a && q.b > w.b )
		return 1;
	return 0;
}

int main()
{
	int n;
	int num = 1;
	while(~scanf("%d", &n) && n)
	{
		int l[3];
		int cnt = 0;
		for( int i = 1; i <= n; i++ )
		{
			scanf("%d%d%d", &l[0], &l[1], &l[2]);
			sort(l, l + 3);
			p[cnt].a = l[1], p[cnt].b = l[0], p[cnt].c = l[2], ++cnt;
			p[cnt].a = l[2], p[cnt].b = l[0], p[cnt].c = l[1], ++cnt;
			p[cnt].a = l[2], p[cnt].b = l[1], p[cnt].c = l[0], ++cnt;
		}
		sort( p, p + cnt, cmp );
		int ans = 0;
		for( int i = 0; i < cnt; i ++ )
		{
			dp[i] = p[i].c;
			//printf("%d\n", dp[i]);
		}
		for( int i = cnt - 2; i >= 0; i -- )
		{
			//printf("%d %d %d\n", p[i].a, p[i].b, p[i].c);
			for ( int j = cnt-1; j >= i+1; j-- )
			{
				if( p[j].a < p[i].a && p[j].b < p[i].b )
				{
					if( dp[i] < dp[j] + p[i].c )
					{
						dp[i] = dp[j] + p[i].c;
					}
				}
				//printf("%d\n", dp[i]);
			}
			ans = max( ans, dp[i] );
		}
		printf("Case %d: maximum height = %d\n", num++, ans); 
	}
	return 0;
}