| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 2 | maomao90 | 163 |
| 4 | atcoder_official | 161 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | nor | 153 |
| 9 | Dominater069 | 153 |
Hello Codeforces community!
Please help on this problem:
Given array with length N (1 ≤ N ≤ 105, 1 ≤ ai ≤ 109). And given Q queries(1 ≤ Q ≤ 105). For each query given one number X. (1 ≤ X ≤ 1014). Find number of subarrays which sum equals to X.
Sorry for my poor English.
i think there is no solution less than o(n2), as there is about o(n2) possible subarrays to count their sum
The thing is, we don't have to enumerate subarrays to get their sum. If you want the actual subarrays, then we cannot have a solution that is better than O(n^2)