#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int T;
cin>>T;
while(T--){
int dp[10001];
int a[100001];
int n ;
memset(dp, 0, sizeof dp);
cin>>n ;
for(int i = 1 ;i<= n ;i++)
cin>>a[i];
int len = 1;
dp[1] = a[1] ;
for(int i = 2 ;i<= n; i++){
if(a[i]>dp[len])
dp[++len] = a[i];
else
dp[lower_bound(dp+1, dp+1+len, a[i])-dp] = a[i];
}
cout<<len<<endl;
}
}
实际上在这里面通过不断维护dp数组,即当前子串中的最大上升序列,通过对比a[i]与dp[len]的大小,若a[i]>dp[len]
则 dp[len++] = a[i] ;
否则对dp[]数组进行维护已确定当前dp数组最优