| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Fusion Trees/Nodes (One of the hardest and most advanced things in PHD/theortical cp).
Do you know any problems that need fusion trees (even in theoretical cp)
I found only a wiki and some MIT lectures but not any good problems that needed it
As far as i know its some good hard but mostly theoretical thing (out of contests and cp material).
I know only 1 problem that needed it to get to O(1).
Any help would be wanted (especially from MIT cs students they must have done it).
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Mr_Tree_HLD_LCA_Master | 2021-01-18 00:15:46 | 1 | Tiny change: ' need fusin trees (e' -> ' need fusion trees (e' | |
| en1 |
|
Mr_Tree_HLD_LCA_Master | 2021-01-18 00:09:28 | 488 | Initial revision (published) |
