yes

102. The Sequence Riddle

Time Limit: 2 seconds

Memory Limit: 256 MB

Rating: 1400

The mastermind has left behind a series of encoded numbers. Intelligence suggests these numbers form a sequence with hidden meaning. Input is denoted by a list of $N$ integers $nums$. - Your task is to find the length of the longest subsequence that is strictly increasing. - A subsequence is a sequence derived from the input array by deleting some or no elements without changing the order of the remaining elements. For example, given $nums = [10, 9, 2, 5, 3, 7, 101, 18]$, the LIS is $[2, 3, 7, 101]$ with a length of $4$.

You are given an integer $N$ on the first line, followed by $N$ integers that form the array $nums$. $1 \le N \le 10{,}000$

Output one integer: the length of the LIS found in the array $nums$.

Sample Input 1:
8
10 9 2 5 3 7 101 18

Sample Output 1:
4

An explanation is already given in the problem statement.

KL Coding Cup March 2025 > Speed Round > Problem 7