#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
using namespace std;
const int MAXN = 1000;
struct Node
{
int x;
int y;
};
Node Point[MAXN];
int Cmp(const void* a, const void* b)//将x按升序排列,然后求纵坐标的最长上升子序列和最长下降子序列
{
Node* aa = (Node *)a;
Node* bb = (Node *)b;
return aa->x - bb->x;
}
int main()
{
int i, j;
int T;
cin>>T;
int n;
int dp[MAXN], dp1[MAXN];
while (T--)
{
memset(dp, 0, sizeof(dp));
memset(dp1, 0, sizeof(dp1));
cin>>n;
for (i = 0; i < n; ++i)
{
cin>>Point[i].x>>Point[i].y;
dp[i] = 1;//至少还有本身这个点
dp1[i] = 1;
}
int ans = 0;
qsort(Point, n, sizeof(Point[0]), Cmp);
for (i = 0; i < n; ++i)
{
for (j = 0; j < i; ++j)
{
if(Point[i].y > Point[j].y && dp[i] < dp[j] + 1)//最长上升子序列
dp[i] = dp[j] + 1;
else if(Point[i].y < Point[j].y && dp1[i] < dp1[j] + 1)//最长下降子序列
dp1[i] = dp1[j] + 1;
}
if(dp[i] > ans)
ans = dp[i];
if(dp1[i] > ans)
ans = dp1[i];
}
cout<<ans<<endl;
}
return 0;
}
因为不知道是单调递增率还是单调递减,因此设置两个数组,同时求单增、单减曲线上的点数