动态规划-试题（6）-最大差值

最大差值

分析

代码

public static int getDis(int[] A, int n) {
Integer[] F = new Integer
;
F[0] = 0;
int currMin = A[0];
for (int i =
4000
1; i < n; i++) {
if (currMin < A[i]){
F[i] = A[i] - currMin;
}else {
currMin = A[i];
F[i] = 0;
}
}

Collections.sort(Arrays.asList(F));
return F[n-1];
}