Quite a tricky problem I was stuck on trying to solve. Would appreciate some help on how to approach it.
Given an array, compute the number of subarrays with a mean = k
1 <= n <= 1e5
1 <= a[i], k <= 1e9
Thanks!
# | User | Rating |
---|---|---|
1 | jiangly | 3860 |
2 | Benq | 3783 |
3 | maroonrk | 3627 |
4 | fantasy | 3526 |
5 | ko_osaga | 3500 |
6 | Um_nik | 3496 |
7 | tourist | 3487 |
8 | inaFSTream | 3477 |
9 | Radewoosh | 3437 |
10 | zh0ukangyang | 3423 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 185 |
2 | awoo | 182 |
3 | nor | 172 |
4 | -is-this-fft- | 169 |
4 | adamant | 169 |
6 | maroonrk | 165 |
7 | antontrygubO_o | 160 |
8 | SecondThread | 158 |
9 | dario2994 | 151 |
9 | kostka | 151 |
Quite a tricky problem I was stuck on trying to solve. Would appreciate some help on how to approach it.
Given an array, compute the number of subarrays with a mean = k
1 <= n <= 1e5
1 <= a[i], k <= 1e9
Thanks!
Name |
---|