#include <iostream>

 #include<cstring>

 #include <algorithm>

 #define INF 0x3f3f3f3f

 using namespace std;

 const int N = 1e5 + ;

 int s[N];

 int n,p,a[N];

 int len;

 int main()

 {

     cin>>n;

     while(n--){

         cin>>p;

         memset(s,,sizeof(s));

         for(int i = ;i<p;i++)cin>>a[i];

         s[] = a[];len = ;//长度从1开始

         for(int i = ;i<p;i++){

             int t = a[i];

             if(t>s[len])s[++len] = a[i];

             else{

         /*************/int l = ,r = len,mid;//这里的二分法采用了左闭右闭的思路

                <span style="white-space:pre">            </span>int ans = ;

                 while(l<=r)

                 {

                     mid = (l+r)/;

                     if(s[mid]<t)

                         {l = mid +;ans = max(ans,mid);}//ans即为思路中的j，j必然为s数组中小于t的最大的数

                     else r = mid-;

                 }

                 s[ans+] = t;/******************/

             }

         }

         //for(int i = 1;i<p;i++){cout<<s[i];}//有必要可以打开看看s中存的是什么值

         cout<<len<<endl;

     }

     return ;

 }

 int p = lower_bound(s+,s+len+,t)-s;

 s[p] = t;