题解 | #Redraiment的走法#

#include <bits/stdc++.h>
using namespace std;
const int N = 210;
int main() {
    int n;
    cin >> n;
    int x;
    vector<int> nums;
    while(cin >> x){
        nums.push_back(x);
    }
    vector<int> dp(n, 1);
    for(int i = 1; i < nums.size(); ++i){
        for(int j = 0; j < i; ++j){
            if(nums[j] < nums[i]){
                dp[i] = max(dp[i], dp[j] + 1);
            }
        }
    }
    int count = 0;
    for(auto i : dp){
        count = max(count, i);
    }
    cout << count << endl;
    return 0;
}
// 64 位输出请用 printf("%lld")