Hello guys, i have a question like this. Given an array has length n, n <= 10^7, a[i][j] <= 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 | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
4 | atcoder_official | 161 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Number of subarray having average sum equal to K
Hello guys, i have a question like this. Given an array has length n, n <= 10^7, a[i][j] <= 10^9. Number K <= 10^9. How i can count number of subarray has average sum equal to K. Thanks for your time.
Name |
---|