1
class Solution {
2
 public:
3
  int minimumDeletions(vector<int> &nums) {
4
    int indmin, indmax, mini(INT_MAX), maxi(INT_MIN), n(nums.size());
5

6
    for (int i = 0; i < n; i++) {
7
      if (maxi < nums[i]) maxi = nums[i], indmax = i;
8
      if (mini > nums[i]) mini = nums[i], indmin = i;
9
    }
10

11
    int before(min(indmin, indmax)), after(max(indmin, indmax));
12
    return min(before + 1 + min(n - after, after - before),
13
               n - after + min(before + 1, after - before));
14
  }
15
};