human
Length of longest increasing index dividing subsequence | Function to find the length of the longest increasing sub - sequence such that the index of the element is divisible by index of previous element.
Initialize the dp [ ] array with 1 as a single element will be of 1 length.
Traverse the given array.
If the index is divisible by the previous index.
If increasing subsequence identified.
Longest length is stored.
Driver code"
Solution in Python:
assistant
#Here is code to length of longest increasing index dividing subsequence and the other steps required.
 def LIIDS ( arr , N ) :
	dp = [ ]
	for i in range ( 1 , N + 1 ) :
		dp . append ( 1 )
	ans = 0
	for i in range ( 1 , N + 1 ) :
		j = i + i
		while j <= N :
			if j < N and i < N and arr [ j ] > arr [ i ] :
				dp [ j ] = max ( dp [ j ] , dp [ i ] + 1 )
			j += i
		if i < N :
			ans = max ( ans , dp [ i ] )
	return ans
arr = [ 1 , 2 , 3 , 7 , 9 , 10 ]
N = len ( arr )
print ( LIIDS ( arr , N ) )