The words contained in this file might help you see if this file matches what you are looking for:

...Olympiads in informatics vol ioi vilnius university doi wavelet trees for competitive programming robinson castro nico lehmann jorge perez bernardo subercaseaux department of computer science universidad de chile beauchef santiago chilean center semantic web research email rocastro nlehmann jperez bsuberca dcc uchile cl abstract the tree is a data structure to succinctly represent sequences elements over fixed but potentially large alphabet it very versatile which exhibits interest ing properties even when its compression capabilities are not considered efficiently supporting several queries although was proposed more than decade ago has yet been widely used by community this paper tries fill gap showing how can be classical problems discussing some implementation details and presenting performance analysis focused setting key words structures quantile query range introduction let sequence integers consider following given pair indices positive integer compute value th smallest element...