| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | atcoder_official | 162 |
| 3 | maomao90 | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | djm03178 | 152 |
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. | Язык | Кто | Когда | Δ | Комментарий | |
|---|---|---|---|---|---|---|
| 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) |
