Is it possible to implement Fenwick Tree for 2-dimensional query when n, m <= 100000?

Revision en1, by duckladydinh, 2017-11-10 14:53:31


I have been looking for an implementation of 2D Fenwick Tree for n, m<= 100000 without using std::map but with no luck. I want to ask if it is possible to implement 2D Fenwick Tree using O(nlogn) memory and O(logn^2) per update?

Tutorials, ideas or papers, all are very welcome.

Thank you.


  Rev. Lang. By When Δ Comment
en1 English duckladydinh 2017-11-10 14:53:31 390 Initial revision (published)