1#include <vector>
2#include <iostream>
3using namespace std;
4
5int countSubarrays(vector<int>& nums, int k) {
6    int count = 0, max_count = 0, max_element = -1, j = 0;
7
8    for (int i = 0; i < nums.size(); i++) {
9        if (nums[i] > max_element) {
10            max_element = nums[i];
11            max_count = 1;
12        } else if (nums[i] == max_element) {
13            max_count++;
14        }
15
16        while (max_count >= k) {
17            count += nums.size() - i;
18            if (nums[j] == max_element) {
19                max_count--;
20            }
21            j++;
22        }
23    }
24
25    return count;
26}
27
28int main() {
29    vector<int> nums = {1, 3, 2, 3, 3};
30    int k = 2;
31    cout << countSubarrays(nums, k) << endl; // Output: 6
32    return 0;
33}