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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
7 | SecondThread | 150 |
9 | orz | 146 |
10 | pajenegod | 145 |
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 |
---|