lec6_34.cpp

// Given an integer array. The task is to find the minimum of the maximum of every window size in the array. Note:Window size varies from 1 to the size of the Array.
//       Ex: N = 7 arr[] = {10,20,30,50,10,70,30} Output: {10,20,30,50,50,70,70}

//       Explanation: 
//       Maximum of windows of size 1 are {10}, {20}, {30}, {50},{10}, {70} and {30}. Minimum of these maximum is 10.
//       Maximum of windows of size 2 are {20}, {30}, {50}, {50}, {70}, and {70}. Minimum of these maximum is 20.