Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int Solution::maximumGap(const vector<int> &A) {
- vector<pair<int,int>> vp;
- for(int i=0; i<A.size(); i++){
- vp.push_back(make_pair(A[i],i));
- }
- sort(vp.begin(), vp.end());
- int min_till_now=INT_MAX,maxi_j=0;
- for(int i=0; i<A.size(); i++){
- if(vp[i].second<min_till_now) min_till_now=vp[i].second;
- if(maxi_j<vp[i].second-min_till_now) maxi_j=vp[i].second-min_till_now;
- }
- return maxi_j;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement