class Solution {
public:
vector<int> findIndices(vector<int>& nums, int index, int val) {
int minv = 0, maxv = 0;
for (int i = index; i < nums.size(); i ++ ) {
int j = i - index;
if (nums[j] > nums[maxv]) {
maxv = j;
} else if (nums[j] < nums[minv]) {
minv = j;
}
if (abs(nums[maxv] - nums[i]) >= val)
return {maxv, i};
if (abs(nums[minv] - nums[i]) >= val)
return {minv, i};
}
return {-1, -1};
}
};
%%%