given an array A of n elements. for indexes j , i such that j>i maximize( j - i ) such that A[j] - A [ i ]> 0 .
Any Algorithm less than O(n^2) would do. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
