C++ :

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;
int main()
{
	//freopen("in.txt", "r", stdin);
	int dp[22], a[22], n, T;
	while (cin>>T)
	{
	    while (T--)
	    {
	        cin>>n;
	        int ans = 0;
	        for (int i=0; i<n; i++)
	        {
	            cin>>a[i];
	            int t = 0;
	            for (int j=0; j<i; j++)
                    if (a[j]>=a[i] && t<dp[j])
                        t = dp[j];
                dp[i] = t+1;
                ans = max(ans, dp[i]);
	        }
	        cout<<ans<<endl;
	    }
	}
	return 0;
}