<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>

typedef long long ll;
// cout debugging statements also take time and can give TLE
class Solution {
    ll helper(const vector<int> &vec,int l,int r,int maxi,int mini){
        int n=r-l+1;
        vector<int> last_min(n+1,n),last_max(n+1,n);

        for(int i=r;i>=l;--i){
            last_max[i-l]=(vec[i]==maxi)?i-l:last_max[i-l+1];
            last_min[i-l]=(vec[i]==mini)?i-l:last_min[i-l+1];
        }
        ll res=0;
        for(int i=l;i<=r;++i){
            int temp=max(last_max[i-l],last_min[i-l]);
            if(temp==n) continue;
            res+=(n-temp);
        }
        return res;
    }
public:
    long long countSubarrays(vector<int>& nums, int mini, int maxi) {
        vector<int> vec;
        vec.push_back(-1);
        for(int i=0;i<nums.size();++i){
            if(nums[i]<mini || nums[i]>maxi) vec.push_back(i);
        }
        vec.push_back(nums.size());
        ll ans=0;
        int l=vec[0]+1;
        for(int i=1;i<vec.size();++i){
            int size=vec[i]-1;
            ans+=helper(nums,l,size,maxi,mini);
            l=vec[i]+1;
        }
        return ans;
    }
};
// 1 3 5 2
92800