题解 | #Redraiment的走法#

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cin >> n;
    vector<int> v;
    for (int i = 0; i < n; i++) {
        int temp;
        cin >> temp;
        v.push_back(temp);
    }
    vector<int> dp(n, 1);
    dp[0] = 1;
    for (int i = 1; i < n; i++) {
        for (int j = 0; j < i; j++) {
            if (v[j] < v[i]) {
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
    }
    int max=0;
    for(int i=0;i<n;i++){
        if(max<dp[i]){
            max=dp[i];
        }
    }
    cout << max;
}
// 64 位输出请用 printf("%lld")