c++代码

#include <iostream>

using namespace std;

const int N = 1005;
int f[N];
int a[N];
int n;
int main()
{
    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> a[i];

    for(int i = 1; i <= n ; i ++)
    {
        f[i] = 1;
        for(int j = 1; j < i; j ++){
            if(a[i] > a[j])
                f[i] = max(f[i], f[j] + 1);
        }
    }
    int maxn = 0;
    for(int i = 1; i <= n ; i ++){
        if(f[i] > maxn) maxn = f[i];
    }

    cout << maxn << endl;
    return 0;
}
//集合：前i个数中，数值单调递增的所有子序列
//属性：MAXN
//状态转移：f[i] = max(f[0],f[1],...f[i-1])+1;