Subsequence
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
Given a sequence, find the length of the largest strictly increasing subsequence.
Input
First line contains the length of the sequence. The second line contains the sequence itself. All numbers are integers not exceeding by absolute value.
Output
Print the maximum length of strictly increasing subsequence.
Examples
Input #1
Answer #1
Submissions 5K
Acceptance rate 42%