do you refer to the lca algorithm as a data structure? I mean the lca algorithm where we keep the 2^i-th parent for each vertex if you do, upvote me. otherwise downvote me.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
do you refer to the lca algorithm as a data structure? I mean the lca algorithm where we keep the 2^i-th parent for each vertex if you do, upvote me. otherwise downvote me.
Hi (; do we have a segment that handle these two queries? 1 : l r d : add an integer d to all elements whose indexes belong to the interval from l to r d<1 2 : l r : how many elements between l and r are bigger than x(x is fixed)
hi every body! i have been AC a problem in problemset two times but in GYM it gets TLE what should i do? (i really need to AC this problem in GYM :) )
Name |
---|