#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int t,n,i,j,a[21],dp[21];
cin>>t;
while(t--){
cin>>n;
for(i=0;i<n;i++){
cin>>a[i];
dp[i]=1;
}
for(i=0;i<n;i++)
for(j=i+1;j<n;j++){
if(a[j]<a[i] && dp[i]+1>dp[j])
dp[j]=dp[i]+1;
}
sort(dp,dp+n);
cout<<dp[n-1]<<endl;
}
return 0;
}
总结:DP