Hello guys, i have a question like this. Given an array has length n, n <= 10^7, a[i] <= 10^9. Number K <= 10^9. How i can count number of subarray has average sum equal to K. Thanks for your time.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
Hello guys, i have a question like this. Given an array has length n, n <= 10^7, a[i] <= 10^9. Number K <= 10^9. How i can count number of subarray has average sum equal to K. Thanks for your time.
Name |
---|
Observe that decreasing every element $$$k$$$ will also decrease the average by $$$k$$$. Thus, if every element in the array is decreased by $$$k$$$, then the answer is equal to the number of subarrays with an average (or equivalently sum) of $$$0$$$.
Consider the prefix sum array $$$p$$$ generated by this new array. It is clear that the subarray $$$[l, r]$$$ has a sum of $$$0$$$ iff $$$p[l-1] = p[r]$$$.
The problem is now reduced to: given an array, count the number of equal pairs. This can be trivially solved by iterating through the array using an unordered_map, and can be solved in $$$O(n)$$$ time.