Groups
Category
An implicit treap is a randomized balanced binary tree that treats array positions as keys without storing them explicitly.
A Fenwick Tree (Binary Indexed Tree) maintains prefix sums so you can update a single position and query a prefix in O(\log n) time with a tiny constant factor.