Is RMQ possible using one Binary Indexed Tree?

Правка en2, от Lakh, 2018-09-02 09:08:06

I read the approach for finding Range minimum value using 2 Binary Indexed Trees. Is it possible to do this problem using only one BIT when updates are also there?

Теги range query, bit/fenwick tree

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Lakh 2018-09-02 09:08:06 28 Tiny change: 'ly one BIT? ' -> 'ly one BIT when updates are also there? '
en1 Английский Lakh 2018-09-02 08:59:25 182 Initial revision (published)