#include <iostream> #include <vector> #include <algorithm> using namespace std; int lengthOfLIS(vector<int>& nums) { if (nums.size() == 0) return 0; vector<int> dp(nums.size(), 1); int maxLength = 1; for (int i = 1; i < nums.size(); i++) { for (int j = 0; j < i; j++) { if (nums[i] > nums[j]) { dp[i] = max(dp[i], dp[j] + 1); } } maxLength = max(maxLength, dp[i]); } return maxLength; } int main() { int n; cin >> n; vector<int> heights(n); for (int i = 0; i < n; i++) { cin >> heights[i]; } int result = lengthOfLIS(heights); cout << result << endl; return 0; }