human
Longest Decreasing Subsequence | Function that returns the length of the longest decreasing subsequence.
Initialize LDS with 1 for all index The minimum LDS starting with any element is always 1.
Compute LDS from every index in bottom up manner.
Select the maximum of all the LDS values.
returns the length of the LDS.
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to longest Decreasing Subsequence and the other steps required.
 def lds ( arr , n ) :
	lds = [ 0 ] * n
	max = 0
	for i in range ( n ) :
		lds [ i ] = 1
	for i in range ( 1 , n ) :
		for j in range ( i ) :
			if ( arr [ i ] < arr [ j ] and lds [ i ] < lds [ j ] + 1 ) :
				lds [ i ] = lds [ j ] + 1
	for i in range ( n ) :
		if ( max < lds [ i ] ) :
			max = lds [ i ]
	return max
if __name__ == " _ _ main _ _ " :
	arr = [ 15 , 27 , 14 , 38 , 63 , 55 , 46 , 65 , 85 ]
	n = len ( arr )
	print ( " Length ▁ of ▁ LDS ▁ is " , lds ( arr , n ) )