<p>You are given an integer array <code>nums</code> and two integers <code>indexDiff</code> and <code>valueDiff</code>.</p>

<p>Find a pair of indices <code>(i, j)</code> such that:</p>

<ul>
	<li><code>i != j</code>,</li>
	<li><code>abs(i - j) &lt;= indexDiff</code>.</li>
	<li><code>abs(nums[i] - nums[j]) &lt;= valueDiff</code>, and</li>
</ul>

<p>Return <code>true</code><em> if such pair exists or </em><code>false</code><em> otherwise</em>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,1], indexDiff = 3, valueDiff = 0
<strong>Output:</strong> true
<strong>Explanation:</strong> We can choose (i, j) = (0, 3).
We satisfy the three conditions:
i != j --&gt; 0 != 3
abs(i - j) &lt;= indexDiff --&gt; abs(0 - 3) &lt;= 3
abs(nums[i] - nums[j]) &lt;= valueDiff --&gt; abs(1 - 1) &lt;= 0
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,5,9,1,5,9], indexDiff = 2, valueDiff = 3
<strong>Output:</strong> false
<strong>Explanation:</strong> After trying all the possible pairs (i, j), we cannot satisfy the three conditions, so we return false.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>-10<sup>9</sup> &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>1 &lt;= indexDiff &lt;= nums.length</code></li>
	<li><code>0 &lt;= valueDiff &lt;= 10<sup>9</sup></code></li>
</ul>

#include <queue>
#include <set>
class Solution {
public:
    bool containsNearbyAlmostDuplicate(vector<int>& nums, int indexDiff, int valueDiff) {
           cin.tie(0)->sync_with_stdio(0);
   cout.precision(18);
        int n=nums.size();

        if (indexDiff==0)return false;
        multiset<int>s;
        queue<int>q;
        for (int i=0;i<indexDiff&&i<n;i++){
            q.push(nums[i]);
            if (i>0){
                 auto left=s.lower_bound(nums[i]-valueDiff);
            auto right = s.upper_bound(nums[i]+valueDiff);
            if (left!=right){
                return true;
            }
            /*if (*right>=nums[i]-valueDiff&&*right<=nums[i]+valueDiff){

                cout<<"a "<<*right;
                auto it=s.begin();
                while(it!=s.end()){
                    cout<<*it<<" ";
                    it++;
                }
                return true;
            }
            if (right!=s.begin()){
                right--;
            }
            if (*right>=nums[i]-valueDiff&&*right<=nums[i]+valueDiff){
                 cout<<"b";
                return true;
            }
            if (*left<=nums[i]+valueDiff&&*left>=nums[i]-valueDiff){
                cout<<"c";
                return true;
            }
            */
            }
           
            s.insert(nums[i]);

        }

        for (int i=indexDiff;i<n;i++){
            q.push(nums[i]);
            auto left=s.lower_bound(nums[i]-valueDiff);
            auto right = s.upper_bound(nums[i]+valueDiff);
            /*
            if (*right>=nums[i]-valueDiff&&*right<=nums[i]+valueDiff){
                return true;
            }
            if (right!=s.begin()){
                right--;
            }
            if (*right>=nums[i]-valueDiff&&*right<=nums[i]+valueDiff){
                return true;
            }
            if (*left<=nums[i]+valueDiff&&*left>=nums[i]-valueDiff){
                return true;
            }
            */
            if (left!=right){
                return true;
            }
            s.erase(s.find(q.front()));
            q.pop();
            s.insert(nums[i]);

        }
        return false;
    }
};
149360