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

<p>A <strong>fixed-bound subarray</strong> of <code>nums</code> is a subarray that satisfies the following conditions:</p>

<ul>
	<li>The <strong>minimum</strong> value in the subarray is equal to <code>minK</code>.</li>
	<li>The <strong>maximum</strong> value in the subarray is equal to <code>maxK</code>.</li>
</ul>

<p>Return <em>the <strong>number</strong> of fixed-bound subarrays</em>.</p>

<p>A <strong>subarray</strong> is a <strong>contiguous</strong> part of an array.</p>

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

<pre>
<strong>Input:</strong> nums = [1,3,5,2,7,5], minK = 1, maxK = 5
<strong>Output:</strong> 2
<strong>Explanation:</strong> The fixed-bound subarrays are [1,3,5] and [1,3,5,2].
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,1,1,1], minK = 1, maxK = 1
<strong>Output:</strong> 10
<strong>Explanation:</strong> Every subarray of nums is a fixed-bound subarray. There are 10 possible subarrays.
</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>1 &lt;= nums[i], minK, maxK &lt;= 10<sup>6</sup></code></li>
</ul>

class Solution {
public:
    long long solve(vector<int> &nums, int minK, int maxK) {
        cout << nums.size() << endl;
        int n = nums.size();
        int left = 0;
        int right = 0;
        int mins = 0;
        int maxs = 0;
        long long answer = 0;
        while(left < n) {
            while(right < n && (mins == 0 || maxs == 0)) {
                if(nums[right] == minK) mins++;
                if(nums[right] == maxK) maxs++;
                right++;
            }
            if(mins == 0 || maxs == 0) break;
            answer += ((long long)n - (long long)right + 1LL);
            if(nums[left] == minK) mins--;
            if(nums[left] == maxK) maxs--;
            left++;
        }
        return answer;
    }
    long long countSubarrays(vector<int>& nums, int minK, int maxK) {
        int n = nums.size();
        int left = 0;
        int right = 0;
        long long answer = 0;
        vector<int> range;
        while(left < n) {
            if(nums[left] < minK || nums[left] > maxK) {
                left++;
                continue;
            }
            right = left;
            range.clear();
            while(right < n && nums[right] <= maxK && nums[right] >= minK) {
                range.push_back(nums[right]);
                right++;
            }
            answer += solve(range, minK, maxK);
            left = right+1;
        }
        return answer;
    }
};
86800