1using System;
2
3public class Solution {
4    public int CountSubarrays(int[] nums, int k) {
5        int count = 0, maxCount = 0, maxElement = -1, j = 0;
6        int n = nums.Length;
7        for (int i = 0; i < n; i++) {
8            if (nums[i] > maxElement) {
9                maxElement = nums[i];
10                maxCount = 1;
11            } else if (nums[i] == maxElement) {
12                maxCount++;
13            }
14            while (maxCount >= k) {
15                count += n - i;
16                if (nums[j] == maxElement) {
17                    maxCount--;
18                }
19                j++;
20            }
21        }
22        return count;
23    }
24
25    public static void Main() {
26        Solution sol = new Solution();
27        int[] nums = {1, 3, 2, 3, 3};
28        int k = 2;
29        Console.WriteLine(sol.CountSubarrays(nums, k)); // Output: 6
30    }
31}