Hay codeforces, Is it possible to solve standard RMQ problem using binary indexed tree with conserving LogN queries ?
RMQ using Binar Indexed Tree. ??
Hay codeforces, Is it possible to solve standard RMQ problem using binary indexed tree with conserving LogN queries ?
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
en1 | OmaeWaMouShenDeiru | 2015-07-14 10:34:27 | 151 | Initial revision (published) |