leetcode

0 class Solution {

1 public:

2 long long countSubarrays(const vector<int> &nums, int k) const {

3 int maxi = *max_element(begin(nums), end(nums));

4 long long res = 0;

5

6 for (int i = 0, j = 0, crnt = 0; j < size(nums); j++) {

7 if (nums[j] == maxi) crnt++;

8 while (crnt >= k)

9 if (nums[i++] == maxi) crnt--;

10 res += i;

11 }

12

13 return res;

14 }

15 };