I was practising a question from Atcoder abc287 f, while reading the editorial for this problem, I encountered something called "square-order tree DP" due to it, by doing a process, which seems O(n^3) at first glance is actually O(n^2) they had linked a blog about it, but it is in Japanese, and I wasn't able to find a relevant resource related to it, in English, if someone, can help me find a relevant resource, or explain why the process is O(n^2) it would be very helpful.
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3741 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3489 |
| 7 | Radewoosh | 3483 |
| 8 | Kevin114514 | 3442 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 169 |
| 2 | atcoder_official | 162 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 18.12.2024 23:48:13 (j2).
Десктопная версия, переключиться на мобильную.
При поддержке
"Sqrt Tree — Algorithms for Competitive Programming" https://cp-algorithms.com/data_structures/sqrt-tree.html This may help, although I understand nothing from this but I get it that it square roots the number of operations or something like that. Check it out
thanks for your effort, but it is unrelated to what I asked
One of the first problems most people saw with this technique is probably https://codeforces.net/contest/815/problem/C. Also, https://usaco.guide/adv/comb-sub has a brief explanation and a set of problems with using this.
Thanks!!! I read the reason, it is indeed very elegant why it is O(n^2), no heavy calculations and only simple reasoning to arrive at it
If I understand it correctly, then an English resource is here (section 7).
Thanks!!!, it is very useful, I was looking for something like this, nice explanation, I also found some more interesting things related to it in comments of your blog.