blob: 86552f2112abfe5d1ca1ee549a14146cbf494193 (
plain)
1
2
3
4
5
6
7
8
9
10
11
|
def longest_increasing_subsequence(arr):
n = len(arr)
longest_increasing_subsequence = [1]*n
for i in range (1 , n):
for j in range(0 , i):
if arr[i] > arr[j] and longest_increasing_subsequence[i]< longest_increasing_subsequence[j] + 1 :
longest_increasing_subsequence[i] = longest_increasing_subsequence[j]+1
maximum = 0
for i in range(n):
maximum = max(maximum , longest_increasing_subsequence[i])
return maximum
|
