<p>Given an integer array <code>nums</code> and two integers <code>left</code> and <code>right</code>, return <em>the number of contiguous non-empty <strong>subarrays</strong> such that the value of the maximum array element in that subarray is in the range </em><code>[left, right]</code>.</p>

<p>The test cases are generated so that the answer will fit in a <strong>32-bit</strong> integer.</p>

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

<pre>
<strong>Input:</strong> nums = [2,1,4,3], left = 2, right = 3
<strong>Output:</strong> 3
<strong>Explanation:</strong> There are three subarrays that meet the requirements: [2], [2, 1], [3].
</pre>

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

<pre>
<strong>Input:</strong> nums = [2,9,2,5,6], left = 2, right = 8
<strong>Output:</strong> 7
</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>0 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
	<li><code>0 &lt;= left &lt;= right &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution {
public:
    int solve(vector<int>& arr, int left, int right) {
        int res=0;
        int last = -1;
        for(int i =0; i < arr.size(); i++) {
            if(arr[i] >= left && arr[i] <= right) {
                res+= i+1;
                last = i;
            } else res+= last +1;
        }
        return res;
    }

    int numSubarrayBoundedMax(vector<int>& nums, int left, int right) {
        int maxVal = 0;
        int res=0;
        vector<int> arr;
        nums.push_back(INT_MAX);
        for(int num : nums) {
            maxVal = max(maxVal, num);
            if(maxVal > right) {
                res+=solve(arr, left,right);
                // cout << num << " ";
                arr = {};
                maxVal =0;
            } else {
                arr.push_back(num);
            }
        }
        return res;
    }
};
56700