Data Structure Array: Given an array arr[], find the maximum j – i such that arr[j] > arr[i]

http://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/

 #include <iostream>
 #include <vector>
 #include <algorithm>
 #include <queue>
 #include <stack>
 #include <string>
 #include <fstream>
 #include <map>
 using namespace std;

 int maxindexdiff(int arr[], int n) {
     vector<int> L(n), R(n);
     L[] = arr[];
     for (int i = ; i < n; i++) L[i] = min(L[i-], arr[i]);
     R[n-] = arr[n-];
     for (int i = n-; i >= ; i--) R[i] = max(R[i+], arr[i]);
     int left, right, ans;
     left = right = ;
     ans = -;
     while (left < n && right < n) {
         if (L[left] < R[right]) {
             ans = max(ans, right - left);
             right++;
         }
         else left++;
     }
     return ans;
 }

 int main() {
     int arr[] = {, , , , , , , , , };
     cout << maxindexdiff(arr, ) << endl;
     return ;
 }