Indu the cartographer watches over the shale slopes of Greystone's stores of ledgers. A careful computation stands between order and chaos. Task: Print the length of the longest strictly increasing subsequence (not necessarily contiguous). Input format: First line: n. Second line: n integers. Output format: Print the LIS length. Constraints: 1 <= n <= 4000; -10^9 <= a[i] <= 10^9.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 4000; -10^9 <= a[i] <= 10^9.
