Dynamic Segment Tree Implementation

Правка en1, от -synx-, 2017-07-05 06:30:54

Hello Codeforces!
I had a doubt regarding implementation of dynamic segment trees. Is this implementation correct in terms of the space reserved for the segment tree nodes O(2 × N × log(MX)). And if it is, is there any advantage of this method over the pointer implementation?


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский -synx- 2017-07-05 06:30:54 381 Initial revision (published)