| # | User | Rating |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Count the most common occurrence of subarray sum.
Count the most common occurrence of subarray sum.
Constraints:
N <= 1e6; abs(ai) <= 1e6
Ex:
Inp:
5 1 1 2 1 4
Out:
3 (there are 3 subarray with the sum of 4: (1, 1, 2), (1, 2, 1), (4)
This question appears in ones of my friends competition and I have no idea how to solve it. Can someone help? Thanks.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en3 |
|
Loserinlife | 2023-06-03 14:16:36 | 2 | Tiny change: 'np:\n\n5\n1 1 2 1 ' -> 'np:\n\n5\n\n1 1 2 1 ' | |
| en2 |
|
Loserinlife | 2023-06-03 14:16:15 | 11 | ||
| en1 |
|
Loserinlife | 2023-06-03 14:15:17 | 367 | Initial revision (published) |
