I just discovered a problem, https://qoj.ac/contest/1901/problem/8616, that the intended solution is https://mirror.codeforces.com/blog/entry/67001. Is there any sub $$$O(nq)$$$ solution for this problem?
I just discovered a problem, https://qoj.ac/contest/1901/problem/8616, that the intended solution is https://mirror.codeforces.com/blog/entry/67001. Is there any sub $$$O(nq)$$$ solution for this problem?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
Removed
Are you interested in $$$\mathcal{O}(q\cdot\sqrt{n}\log^2(n)\log(max))$$$ solution?
EDIT:
I made a blog about this over an array(just use hld and you will have array one $$$\cdot\log{n}$$$ in the complexity).