<p>You are given an integer array <code>nums</code> and a <strong>positive</strong> integer <code>k</code>.</p>

<p>Return <em>the number of subarrays where the <strong>maximum</strong> element of </em><code>nums</code><em> appears <strong>at least</strong> </em><code>k</code><em> times in that subarray.</em></p>

<p>A <strong>subarray</strong> is a contiguous sequence of elements within an array.</p>

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

<pre>
<strong>Input:</strong> nums = [1,3,2,3,3], k = 2
<strong>Output:</strong> 6
<strong>Explanation:</strong> The subarrays that contain the element 3 at least 2 times are: [1,3,2,3], [1,3,2,3,3], [3,2,3], [3,2,3,3], [2,3,3] and [3,3].
</pre>

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

<pre>
<strong>Input:</strong> nums = [1,4,2,1], k = 3
<strong>Output:</strong> 0
<strong>Explanation:</strong> No subarray contains the element 4 at least 3 times.
</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>6</sup></code></li>
	<li><code>1 &lt;= k &lt;= 10<sup>5</sup></code></li>
</ul>

class Solution {
public:
    long long countSubarrays(vector<int>& nums, int k) {
        int target=*max_element(nums.begin(),nums.end()),n=nums.size();
        vector<int> p(n,0);
        // if(n==1)return 1ll;
        if(nums[0]==target)p[0]=1;
        long long ans=0;
        vector<int> mp(n+1,0);
        mp[0]=-1;
        for(int i=1;i<n;i++){p[i]=p[i-1]+(nums[i]==target);}
        // mp[0]=0;
        for(int i=0;i<n;i++){
            if(p[i]==0){
                mp[0]=i;
            }else{
                break;
            }
        }
        // cout<<mp[0]<<endl;
        for(int i=0;i<n;i++){
            // cout<<p[i]<<" ";
            int value=p[i]-k;
            // if(value==0){
            //  ans++;
            // }
            if(value>=0){
                int r=i-mp[value];
                int v1=i+1;
                int v2=r-1;
                // cout<<value<<" "<<v1<<" "<<v2<<endl;
                ans=ans+v1-v2;
            }
            // cout<<ans<<endl;
             mp[p[i]]=i;
        }
        return ans;

        
    }
};
130600