This is for basic, below-IOI level problemsets. If one knows the top-down, recursive segment tree, it should be sufficient to solve all segment tree problems that don't rely heavily on constant-time optimization, right?
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 159 |
5 | atcoder_official | 156 |
6 | djm03178 | 153 |
6 | adamant | 153 |
8 | luogu_official | 149 |
9 | awoo | 147 |
10 | TheScrasse | 146 |
Quick opinion poll: How important is it to know the bottom-up segment tree?
This is for basic, below-IOI level problemsets. If one knows the top-down, recursive segment tree, it should be sufficient to solve all segment tree problems that don't rely heavily on constant-time optimization, right?
Name |
---|