Persistent Segment trees

Правка en1, от bhargav104, 2017-01-17 11:36:59

Why do we always break down a query into prefix query when the problem involves Persistent Segment tree is it not possible to directly query a range [L,R]? For example consider this problem and the editorial — http://www.codechef.com/SNCKEL16/problems/SEGSUMQ

If we sort the vectors by the angle and then insert into the persistent segment tree in that order when we get a query <C,D> we can just query that segment tree in which all the vectors in it have lesser angle.

Am i missing something here? Could use some help. Thanks :)

Теги persistent segment tree, snackdown2016

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский bhargav104 2017-01-17 11:38:11 0 (published)
en2 Английский bhargav104 2017-01-17 11:37:37 9 (saved to drafts)
en1 Английский bhargav104 2017-01-17 11:36:59 568 Initial revision (published)