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.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | maroonrk | 152 |
| 4 | nor | 152 |
| 6 | -is-this-fft- | 151 |
| 7 | TheScrasse | 148 |
| 8 | atcoder_official | 146 |
| 9 | Petr | 145 |
| 10 | pajenegod | 144 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 26.06.2024 03:08:22 (l3).
Десктопная версия, переключиться на мобильную.
При поддержке
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.