1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit

Given an array of integers nums and an integer limit, return the size of the longest non-empty subarray such that the absolute difference between any two elements of this subarray is less than or equal to limit.

class Solution {
public:
   int longestSubarray(vector<int>& A, int limit) {
        multiset<int> ms;
       int res = 0;
       for(int l = 0, r = 0; r < A.size(); r++) {
           ms.insert(A[r]);
           while(!ms.empty() and *ms.rbegin() - *ms.begin() > limit) {
               ms.erase(ms.find(A[l++]));
           }
           res = max(res, r - l + 1);
       }
        return res;
    }
};