|| ||Code Submission Evaluation System
CSES Problem Set
Task | Statistics
CSES - Increasing SubsequenceCSES - Increasing Subsequence
|Time limit:||1.00 s
||Memory limit:||512 MB|
You are given an array that contains $n$ integers. Your task is to determine the longest increasing subsequence in the array.
An increasing subsequence is a set of values in the array in their original order such that each number is larger than the previous number.
The first line contains an integer $n$: the size of the array.
After this there are $n$ integers $x_1,x_2,\ldots,x_n$: the contents of the array.
Print the length of the longest increasing subsequence.
- $1 \le n \le 2 \cdot 10^5$
- $1 \le x_i \le 10^9$
7 3 5 3 6 2 9 8