Python3 implementation to Find the minimum concatenation required to get strictly Longest Increasing Subsequence for the given array with repetitive elements
from bisect import bisect_left NEW_LINE def LIS ( arr , n ) : NEW_LINE