Java implementation to Find the minimum concatenation required to get strictly Longest Increasing Subsequence for the given array with repetitive elements
import java . io . * ; import java . util . * ; class GFG { static void LIS ( int arr [ ] , int n ) {