Cod sursă (job #750874)

#include <bits/stdc++.h>
using namespace std;

ifstream fin("s2c.in");
ofstream fout("s2c.out");

int dp[2005];
int a[2005];
int n, t;

int main()
{
    int i, j, maxi;
    fin >> t;
    while(t--)
    {
        fin >> n;
        for(i=1; i<=n; i++)
            fin >> a[i];
        for(j=1; j<=n; j++)
            dp[j] = 0;
        for(i=n; i>=1; i--)
        {
            maxi = 0;
            for(j=i + 1; j<=n; j++)
                if(dp[j] > maxi && a[i] < a[j + 1]) maxi = dp[j];
            dp[i] = maxi + 1;
        }
        maxi = 0;
        for(i=1; i<=n; i++)
            maxi = max(maxi, dp[i]);
        fout << maxi << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}