Given an array of n integers. Write a program to find the minimum number of changes in the array so that array is strictly increasing.
In strictly increasing array A[i] < A[i+1] for 0 <= i < n
This problem is a variation of the Longest Increasing Sub-sequence problem.
To find the minimum number of changes required to make the array strictly non-increasing is to find the elements that are not part of the LIS.
1. Find the LIS of the given array. This can be done in O(NlogN)
2. Subtract the length of the array and the length of the LIS.
The above approach can be implemented as follows: