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

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

<pre>
<strong>Input:</strong> nums = [8,2,4,7], limit = 4
<strong>Output:</strong> 2 
<strong>Explanation:</strong> All subarrays are: 
[8] with maximum absolute diff |8-8| = 0 &lt;= 4.
[8,2] with maximum absolute diff |8-2| = 6 &gt; 4. 
[8,2,4] with maximum absolute diff |8-2| = 6 &gt; 4.
[8,2,4,7] with maximum absolute diff |8-2| = 6 &gt; 4.
[2] with maximum absolute diff |2-2| = 0 &lt;= 4.
[2,4] with maximum absolute diff |2-4| = 2 &lt;= 4.
[2,4,7] with maximum absolute diff |2-7| = 5 &gt; 4.
[4] with maximum absolute diff |4-4| = 0 &lt;= 4.
[4,7] with maximum absolute diff |4-7| = 3 &lt;= 4.
[7] with maximum absolute diff |7-7| = 0 &lt;= 4. 
Therefore, the size of the longest subarray is 2.
</pre>

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

<pre>
<strong>Input:</strong> nums = [10,1,2,4,7,2], limit = 5
<strong>Output:</strong> 4 
<strong>Explanation:</strong> The subarray [2,4,7,2] is the longest since the maximum absolute diff is |2-7| = 5 &lt;= 5.
</pre>

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

<pre>
<strong>Input:</strong> nums = [4,2,2,2,4,4,2,2], limit = 0
<strong>Output:</strong> 3
</pre>

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

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

class Solution {
public:
    struct MaxStack {
        stack<pair<int, int>> stk;
        bool empty() { return stk.empty(); }
        void push(int e) { stk.push(make_pair(e, max(e, this->getMax()))); }
        void pop() { stk.pop(); }
        int top() { return stk.top().first; }
        int getMax() { return stk.empty() ? -1 : stk.top().second; }
    };

    struct MinStack {
        stack<pair<int, int>> stk;
        bool empty() { return stk.empty(); }
        void push(int e) { stk.push(make_pair(e, min(e, this->getMin()))); }
        void pop() { stk.pop(); }
        int top() { return stk.top().first; }
        int getMin() { return stk.empty() ? (1000000000 + 5) : stk.top().second; }
    };

    struct MaxQueue {
        MaxStack stk1, stk2;
        void push(int e) { stk1.push(e); }
        void pop() {
            if (stk2.empty()) {
                while (!stk1.empty()) {
                    stk2.push(stk1.top());
                    stk1.pop();
                }
            }
            stk2.pop();
        }
        int getMax() {
            int result = -1;
            if (!stk1.empty())
                result = max(stk1.getMax(), result);
            if (!stk2.empty())
                result = max(stk2.getMax(), result);
            return result;
        }
    };

    struct MinQueue {
        MinStack stk1, stk2;
        void push(int e) { stk1.push(e); }
        void pop() {
            if (stk2.empty()) {
                while (!stk1.empty()) {
                    stk2.push(stk1.top());
                    stk1.pop();
                }
            }
            stk2.pop();
        }
        int getMin() {
            int result = 1000000000 + 5;
            if (!stk1.empty())
                result = min(stk1.getMin(), result);
            if (!stk2.empty())
                result = min(stk2.getMin(), result);
            return result;
        }
    };

    int longestSubarray(vector<int>& nums, int limit) {
        int result = 1, QueueLen = 0;
        MaxQueue maxQ;
        MinQueue minQ;
        for (auto& num : nums) {
            maxQ.push(num), minQ.push(num), QueueLen++;
            while (maxQ.getMax() - minQ.getMin() > limit)
                maxQ.pop(), minQ.pop(), QueueLen--;
            result = max(result, QueueLen);
        }
        return result;
    }
};
88705