Count Subarrays Where Max Element Appears at Least K Times

class Solution {
public:
    long long countSubarrays(vector<int>& nums, int k) {
        long long ans = 0;
        int N = (int)nums.size(), mx = *max_element(nums.begin(), nums.end());
        int l = 0, r = 0, cnt = 0;
        while(r < N) {
            if(nums[r] == mx) ++ cnt;
            while(cnt >= k) {
                if(nums[l] == mx) -- cnt;
                ++ l;
                ans += N - r;
            }
            ++ r;
        }
        return ans;
    }
};