| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | nor | 157 |
| 4 | atcoder_official | 156 |
| 4 | cry | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 8 | adamant | 153 |
| 9 | Um_nik | 151 |
| 10 | djm03178 | 146 |
Question: QTREE5
I have read a solution that uses Centroid Decomposition but was unable understand how the querying in Centroid Tree reflects the same in the original Tree?? Edges are changed.Path from u to v might not contain centroids why does that appraoch work?
Can someone help?
What's wrong with my question? Besides not getting any help, there are many downvotes. Can i know the reason please? I am losing trust in codeforces. Sorry.
It is because you are green.