codeforces/1840C.cpp at main · Nithin0306/codeforces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include <bits/stdc++.h>
using namespace std;

int main()
{
    long long t;
    cin >> t;

    while (t--)
    {
        long long n, k, q;
        cin >> n >> k >> q;

        vector<long long> a(n);

        for (int i = 0; i < n; i++)
        {
            cin >> a[i];
            a[i] = (a[i] > q) ? 0 : 1;
        }

        long long count_1 = 0;
        long long ways = 0;

        for (int i = 0; i < n; i++)
        {
            if (a[i] == 1)
                count_1++;
            else
            {
                if (count_1 >= k)
                {
                    long long diff = count_1 - k + 1;
                    ways += (diff * (diff + 1)) / 2;
                }
                count_1 = 0;
            }
        }

        if (count_1 >= k)
        {
            long long diff = count_1 - k + 1;
            ways += (diff * (diff + 1)) / 2;
        }

        cout << ways << endl;
    }

    return 0;
}