works/solutions/leetcode/cpp/1343.cpp


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

#include <vector>

using std::vector;

class Solution
{
public:
    int numOfSubarrays(vector<int> &arr, int k, int threshold)
    {
        const auto end = arr.cend();
        auto iter = arr.cbegin();
        auto last_iter = arr.cbegin();

        double sum = 0;

        int result = 0;

        for (int i = 0; i < k; i++)
        {
            sum += *iter++;
        }

        while (iter != end)
        {
            if (sum / k >= threshold)
            {
                result++;
            }
            sum -= *last_iter++;
            sum += *iter++;
        }

        if (sum / k >= threshold)
        {
            result++;
        }

        return result;
    }
};