Python3 program to find maximum sum increasing subsequence till i - th index and including k - th index .
def pre_compute ( a , n , index , k ) : NEW_LINE INDENT dp = [ [ 0 for i in range ( n ) ] for i in range ( n ) ] NEW_LINE DEDENT