nyoj 16 最长上升子序列变形

#include <algorithm>
#include <cstdio>
using namespace std;

const int N = 1000;
int dp
;

struct Node
{
int x, y;
bool operator < ( const Node & o ) const
{
if ( x != o.x ) return x < o.x;
return y < o.y;
}
} node
;

int main ()
{
int t;
scanf("%d", &t);
while ( t-- )
{
int n;
scanf("%d", &n);
for ( int i = 0; i < n; i++ )
{
scanf("%d%d", &node[i].x, &node[i].y);
if ( node[i].x > node[i].y )
{
swap( node[i].x, node[i].y );
}
}
sort( node, node + n );
int ans = -1;
for ( int i = 0; i < n; i++ )
{
dp[i] = 1;
for ( int j = 0; j < i; j++ )
{
if ( node[j].x < node[i].x && node[j].y < node[i].y )
{
dp[i] = max( dp[i], dp[j] + 1 );
}
}
ans = max( ans, dp[i] );
}
printf("%d\n", ans);
}
return 0;
}