查找数组中最大丢落的算法

I have an algorithm question:

我有一个算法问题：

Given an array(assuming all the elements are intergers) of size N, find the largest drop(not necessarily continuous) : max{array[i]-array[j]} with a constraint: i>j .Giv