I am just stuck at_ HLD technique_ and the also the Dynamic tree . I am fair enough good at LCA but I feel helpless at dynamic changes in tree . I want to understand how to code and where to update for different Queries . Thanks in advance ..
# | User | Rating |
---|---|---|
1 | jiangly | 3845 |
2 | tourist | 3798 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3589 |
6 | Ormlis | 3532 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | Um_nik | 3450 |
# | User | Contrib. |
---|---|---|
1 | cry | 165 |
2 | -is-this-fft- | 160 |
2 | Qingyu | 160 |
4 | atcoder_official | 157 |
5 | Dominater069 | 155 |
6 | adamant | 154 |
7 | djm03178 | 151 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | Um_nik | 146 |
I am just stuck at_ HLD technique_ and the also the Dynamic tree . I am fair enough good at LCA but I feel helpless at dynamic changes in tree . I want to understand how to code and where to update for different Queries . Thanks in advance ..
Name |
---|
I can't discuss anything to you because I don't understand what problem did you get. But I have some example and they could help you.
Dynamic tree (Splay tree) with queries doAssign, doReverse, and getSum (thanks dongockhanh1997 about this): https://sites.google.com/site/kc97ble/container/splaytree-cpp-3
Heavy light decomposition with queries increase value of one node and get maximum value in the road between node u and node v. https://sites.google.com/site/kc97ble/container/heavylight-cpp
These examples was written very detailed, but language used is Vietnamese, I'm sorry about the inconvenience. Of course, sources are much readable.
I hope this link will help you.