Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Longest Non-Decreasing Subsequence

Longest Non-Decreasing Subsequence

Difficulty: 1600 5000 ms 128 MB

dp binary-search

Find the length of the longest non-decreasing subsequence (equal values may be consecutive in the subsequence).

Input: the first line has N; the second line has the array.

Output: the length.

Constraints:

  • 1 ≤ N ≤ 105
  • 1 ≤ ai ≤ 109

Sample Tests

Input 1
5
1 2 2 3 3
Output 1
5
Input 2
1
7
Output 2
1
Input 3
4
4 4 4 4
Output 3
4

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen