1438. 绝对差不超过限制的最长连续子数组

class Solution {
public:
    int longestSubarray(vector<int>& nums, int limit) {
        multiset<int> s;
        int n = nums.size();
        int left = 0, right = 0;
        int maxlen = 0;
        while (right < n) 
        {
            s.insert(nums[right]);
            while (*s.rbegin() - *s.begin() > limit) 
            {
                s.erase(s.find(nums[left]));
                left++;
            }
            maxlen = max(maxlen, right - left + 1);
            right++;
        }
        return maxlen;
    }
};