| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3821 |
| 3 | Benq | 3736 |
| 4 | Radewoosh | 3631 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3388 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 161 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
Help in Mo's Algorithm Problem 877F
In Problem 877F , how to apply Mo's algorithm ? while traversing each block what to do ? editorial is not well explained .
Suppose a[] = { 1 , 1 , 1 , -1 } . We want to get all subarray's in the range 2--4 with sum = 1 .
Approach with HashMap would be linear complexity and total Time Complexity would be O(N*Q) if there are q queries.
**how to reduce it to sqrt. decomposition . **
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en7 |
|
do_good_ | 2019-02-06 09:17:46 | 4 | ||
| en6 |
|
do_good_ | 2019-02-06 09:17:27 | 11 | Tiny change: 'mposition ! Any idea ** ' -> 'mposition . ** ' | |
| en5 |
|
do_good_ | 2019-02-06 09:17:06 | 6 | ||
| en4 |
|
do_good_ | 2019-02-06 06:55:12 | 12 | ||
| en3 |
|
do_good_ | 2019-02-06 00:05:51 | 6 | ||
| en2 |
|
do_good_ | 2019-02-06 00:05:27 | 14 | ||
| en1 |
|
do_good_ | 2019-02-06 00:05:02 | 532 | Initial revision (published) |
