最长上升子序列

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

int a[1005], dp[1005];

int main(){
    int n;
    cin >> n;
    for(int i = 1; i <= n; i ++ ) cin >> a[i];
    
    int cnt = 0;
    for(int i = 1; i <= n; i ++ ){
        dp[i] = 1;
        for(int j = 1; j < i; j ++ ){
            if(a[i] > a[j])
                dp[i] = max(dp[i], dp[j] + 1);
        }
        cnt = max(cnt, dp[i]);
    }
    cout << cnt;
    return 0;
}