题解

#include<bits/stdc++.h>
using namespace std;
int a[10001];
int dp[10001];
int main(){
    int n, maxn = 0;
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = 1; i <= n; i++){
        dp[i] = 1;
        for(int j = 1; j < i; j++){
            if(a[j] < a[i]) dp[i] = max(dp[j]+1, dp[i]); 
        }
        maxn = max(maxn, dp[i]);
    }
    cout << maxn;
    return 0;
}