A collector walks through badge ranks and wants the longest subsequence that increases strictly, even when skipping badges. Task: Find the length of the longest strictly increasing subsequence, not necessarily contiguous. Input format: n; then n integers. Output format: Print the LIS length. Constraints: 1 <= n <= 200000; values fit signed 32-bit integers
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 200000; values fit signed 32-bit integers
Tags:
