单调递增最大子序列C++代码

#include <iostream>
#include <vector>

using namespace std;

int main()
{
int n;
cin >> n;

vector<int> nums(n);
for (int i = 0; i < n; i++) {
cin >> nums[i];
}

vector<int> dp(n, 1);
int max_len = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (nums[j] < nums[i]) {
dp[i] = max(dp[i], dp[j] + 1);
}
}
max_len = max(max_len, dp[i]);
}

cout << max_len << endl;

return 0;
}