hdu1069-最长连续上升子序列

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

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<bitset>
#include<iomanip>
#include<stdlib.h>
using namespace std;
#define MAX 2005 
struct node 
{
	int x , y , ans ;
}edge[ MAX ] ;

int cmp( const node a , const node b )
{
	if( a.x != b.x )
		return a.x < b.x ;
	else
		return a.y < b.y ;
}

int main()
{
	int n ;
	int k = 0 ;  
	int Case = 1 ;
	while( scanf( "%d" , &n ) != EOF , n )
	{
		k = 0 ; 
		memset( edge , 0 , sizeof( edge ) ) ; 
		while( n-- )
		{
			int a , b , c ;
			scanf( "%d%d%d" , &a, &b, &c ) ;
			edge[ k ].x = a ; 
			edge[ k ].y = b ; 
			edge[ k ].ans = c ; 
			++k ;
			edge[ k ].x = b ;
			edge[ k ].y = c ;
			edge[ k ].ans = a ;
			++k ;
			edge[ k ].x = c ;
			edge[ k ].y = a ;
			edge[ k ].ans = b ;
			++k ;
			edge[ k ].x = a ;
			edge[ k ].y = c ;
			edge[ k ].ans = b ;
			++k;
			edge[ k ].x = b ;
			edge[ k ].y = a ;
			edge[ k ].ans = c ;
			++k ;
			edge[ k ].x = c ;
			edge[ k ].y = b ;
			edge[ k ].ans = a ;
			++k ;
		}
		sort( edge , edge + k , cmp ) ;	
		for( int i = 1 ; i < k ; ++i )
		{
			int temp = 0 ;
			for( int j = 0 ; j < i ; ++j )
			{
				if( ( ( edge[ j ].x  < edge[ i ].x && edge[ j ].y < edge[ i ].y ) ||(edge[j].x < edge[j].y &&edge[j].y < edge[j].x) ) && edge[ j ].ans > temp )
					temp = edge[ j ].ans ;
			}
			edge[ i ].ans += temp ;
		}
		int Max = 0 ;
		for( int i = 0 ; i < k ; ++i )
		{
			if( edge[ i ].ans > Max )
				Max = edge[ i ].ans ;
		}
		printf( "Case %d: maximum height = %d\n" , Case++ , Max ) ;
	}
	return 0 ;
}