Is RMQ possible using one Binary Indexed Tree?

Revision en1, by Lakh, 2018-09-02 08:59:25

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?

Tags range query, bit/fenwick tree

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Lakh 2018-09-02 09:08:06 28 Tiny change: 'ly one BIT? ' -> 'ly one BIT when updates are also there? '
en1 English Lakh 2018-09-02 08:59:25 182 Initial revision (published)