Leet Code Daily 2024-06-23 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

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