akshitagit / akshitagit/Python
LONGEST INCREASING SUBSEQUENCE
オープン
algorithms
datastructures
DSA
good first issue
hacktoberfest
hacktoberfest2020
hactoberfest
INTERVIEW-QUESTION
- 主要言語
- Python
- スター
- 124
- フォーク
- 109
- PR マージ指標
- 30日以内にマージされた PR はありません
説明
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
コントリビューションガイド
評価
この issue はまだ評価されていません。