Longest Increasing Subsequence
Aperta
algorithms
C
CPP
dynamic-programming
good first issue
hacktoberfest
Hacktoberfest2020
hard
- Lingua principale
- C++
- Stelle
- 504
- Fork
- 436
- Metriche di merge delle PR
- Nessuna PR unita negli ultimi 30g
Descrizione
Find the length of the longest subsequence in a given array A of integers such that all elements of the subsequence are sorted in strictly ascending order.
Input Format
The first line contains a single integer n.
Next line contains n space separated numbers denoting the elements of the array.
Constraints
0 < n< 105
0 < Ai < 105
Output Format
Print a single line containing a single integer denoting the length of the longest increasing subsequence.
Sample Input
6
50 3 10 7 40 80
Sample Output
4
Explanation
The longest subsequence in test case is - 3,7,40,80
Guida per i contributori
Nessuna guida per i contributori indicizzata per questo repository
Valutazione
Questa issue non è ancora stata valutata.