ZOJ 2136(Longest Ordered Subsequence)

//经典dp

#include<iostream>#include<algorithm>using namespace std;int a[1001], dp[1001];int main(void){    int n, N, ans;    cin >> N;    while (N--)    {        cin >> n;        ans = 0;        for (int i = 1; i <= n; i++)        {            cin >> a[i];            dp[i] = 1;            for (int j = 1; j < i; j++)            {                if (a[j] < a[i]) dp[i] = max(dp[i], dp[j] + 1);            }            ans = max(ans, dp[i]);        }        cout << ans << endl;        if (N) cout << endl;    }    return 0;}