Array problem

Given an array A of n integers, find two indexes i, j such that  j > i and maximize (j - i) with A[j] - A[i] > 0