题解

X-03课上源码

#include<iostream>
using namespace std;
int n;
int a[1001], dp[10001];
int main(){
    cin >> n;
    int num = 0;
    for (int i = 1; i <= n ;i++){
        cin >> a[i];
    }
    for (int i = 1; i <= n; i++){
        dp[i] = 1;
    }
    for (int i = 1; i <= n; i++){
        for (int j = 1; j < i; j++){
            if (a[j] < a[i]){
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
    }
    for (int i = 1; i <= n; i++){
        num = max(num, dp[i]);
    }
    cout << num;
    return 0;
}

加入我的团队吧，求求了
少年先疯队