영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
You are given an array containing n integers. Your task is to determine the longest increasing subsequence in the array, i.e., the longest subsequence where every element is larger than the previous one.
A subsequence is a sequence that can be derived from the array by deleting some elements without changing the order of the remaining elements.
Input
The first line contains an integer n: the size of the array.
After this there are n integers x_1,x_2,…,x_n: the contents of the array.
Output
Print the length of the longest increasing subsequence.
Constraints
- 1 ≤ n ≤ 2 · 10^5
- 1 ≤ x_i ≤ 10^9
예제
예제 1
8 7 3 5 3 6 2 9 8
4