American Regiment 2016 online programming problem maximum difference (greedy)

Title Description

There is an n-long array A, which satisfies the maximum value of 0≤a≤b<n's a[b]-a[a].

Given the array A and its size n, return the maximum difference.

Test examples:

[10,5],2

Returns: 0

Idea: The maximum interpolation value dis is initialized to 0, with a pointer traversing from the beginning, the pointer is found before the minimum value of the element pointed to is the min1, if the pointer points to the element A[i]-min1 > Dis, the dis is updated to a[i]-min1.

1 classLongestdistance {2  Public:3     intGetdis (vector<int> A,intN) {4         //Write code here5         intdis =0;//The maximum difference is initialized to 06         intMin1 = a[0];7          for(inti =1; I < n; i++){8Min1 =std::min (Min1, a[i]);9dis = Std::max (dis, a[i]-min1);Ten         } One         returndis; A     } -};

American Regiment 2016 online programming problem maximum difference (greedy)