已知数列a[...] 求一个数对<ai,aj> 使得i<j 且 aj-ai最大

    时间复杂度：O(N)

    空间复杂度：2N

pseudocode:

maxDirectedDiff(array[] a) {
    minNumber[] m
    
    m[1] = a[1]
    for i = 2 ... a.length
        m = a[i] < m[i-1] ? a[i] : m[i-1]

    result = MIN_INT
    for i = 2 ... a.length
        result = a[i] - m[i-1] > result ? a[i] - m[i-1] : result
 
    return result
}

转载于:https://my.oschina.net/tsingxu/blog/99363