最长上升子序列.cpp

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

int lengthOfLIS(vector<int>& nums) {
        int n = (int)nums.size();
        if (n == 0) {
            return 0;
        }
        vector<int> dp(n, 0);
        for (int i = 0; i < n; ++i) {
            dp[i] = 1;
            for (int j = 0; j < i; ++j) {
                if (nums[j] < nums[i]) {
                    dp[i] = max(dp[i], dp[j] + 1);
                }
            }
        }
        return *max_element(dp.begin(), dp.end());
}

int main(){
    int n;

    vector<int> nums;
    for (int i=0; i<n; i++){
        int num;
        cin >> num;
        nums.push_back(num);
    }

    int res = lengthOfLIS(nums);
    cout << res;
    return 0;
}