sparse Table Vs segment tree

Правка en1, от uttom, 2016-08-03 08:06:17

For preprocessing in segment tree and sparse table Both takes O(nlogn) times. And in every query both takes O(log(n)) times. But How sparse Table faster than Segment tree? Thanks in Advance.

Теги #data structure

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский uttom 2016-08-03 08:06:17 229 Initial revision (published)