Cod sursă (job #548138)

#include <bits/stdc++.h>
using namespace std;
ifstream in("s2c.in");
ofstream out("s2c.out");
int n;
int v[2005];
int c[2005];
int maxx[2005];
int dp[2005][2005];
void f()
{
    memset(dp, 0, sizeof(dp));
    in >> n;
    for(int i = 1; i <= n; i ++)
    {
        in >> v[i];
        c[i] = v[i];
    }
    sort(c + 1, c + n + 1);
    for(int i = 1; i <= n; i ++)
        v[i] = (lower_bound(c + 1, c + n + 1, v[i]) - (c + 1));
    int sol = 0;
    for(int i = 1; i < n; i ++)
    {
        memset(maxx, 0, sizeof(maxx));
        for(int j = 1; j < i; j ++)
            maxx[v[j]] = max(maxx[v[j]], dp[j][i]);
        for(int j = 1; j <= n; j ++)
            maxx[j] = max(maxx[j - 1], maxx[j]);
        for(int j = i + 1; j <= n; j ++)
        {
            dp[i][j] = maxx[v[j] - 1] + 1;
            sol = max(sol, dp[i][j]);
        }
    }
    out << sol + 1 << '\n';
}

int main()
{
    int t;
    in >> t;
    while(t --)
        f();
    return 0;
}