(牛客)最大差值(贪心)

class LongestDistance {
public:
int getDis(vector<int> A, int n) {
// write code here
vector<int> :: iterator it;
int ans=0,minx=9999999;
for(it=A.begin();it<A.end();it++){
if(*it<minx)
minx=*it;
if(ans<*it-minx)
ans=*it-minx;
}
return ans;
}
};