Convert to Strictly increasing integer array with minimum changes.cpp

//Given an array of n integers. Write a program to find minimum number of changes in array so that //array is strictly increasing of integers. In strictly increasing array A[i] < A[i+1] for //0 <= i //< n

//Examples:

//Input : arr[] = { 1, 2, 6, 5, 4}
//Output : 2
//We can change a[2] to any value 
//between 2 and 5.
//and a[4] to any value greater then 5. 

//Input : arr[] = { 1, 2, 3, 5, 7, 11 }
//Output : 0
//Array is already strictly increasing.

// CPP program to find min elements to 
// change so array is strictly increasing 
#include <bits/stdc++.h> 
using namespace std; 
  
// To find min elements to remove from array 
// to make it strictly increasing 
int minRemove(int arr[], int n) 
{ 
    int LIS[n], len = 0; 
  
    // Mark all elements of LIS as 1 
    for (int i = 0; i < n; i++) 
        LIS[i] = 1; 
  
    // Find LIS of array 
    for (int i = 1; i < n; i++) { 
        for (int j = 0; j < i; j++) { 
            if (arr[i] > arr[j] && (i-j)<=(arr[i]-arr[j])){ 
                LIS[i] = max(LIS[i], LIS[j] + 1); 
            } 
        } 
        len = max(len, LIS[i]); 
    } 
  
    // Return min changes for array 
    // to strictly increasing 
    return n - len; 
} 
  
// Driver program to test minRemove() 
int main() 
{ 
    int arr[] = { 1, 2, 6, 5, 4 }; 
    int n = sizeof(arr) / sizeof(arr[0]); 
  
    cout << minRemove(arr, n); 
  
    return 0; 
}