Hi All, Can anyone help me solving this problem ?
Given a non-empty array A consisting of N integers. Find Max(j-i), s.t 0<=i<=j<N and A[i]<=A[j] Here (i, j) is a Monotonic Pair, satisfying the above condition. Space Complexity : O(n) Time Complexity: O(n) -- Regards... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com.
