Hmm, I hadn’t heard of this “binary indexed tree” or “Fenwick tree” alternative to the segment tree (#algorithms) that can’t handle #RMQ problems, in half the space and less time. It sounds like #mipmapping of #sumtables?
on 02015-08-10“a logarithmic-time alternative to summed-area tables for reducing arbitrary semigroup operations over arbitrary ranges (a generalization of #RMQ segment trees)” #cumsum #algorithms #sumtables
on 02015-08-10