Concepts3
🗂️Data StructureIntermediate
Sqrt Decomposition
Sqrt decomposition partitions an array into about \(\sqrt{n}\) blocks, each of size about \(\sqrt{n}\), to speed up range queries and updates.
#sqrt decomposition#block decomposition#bucket decomposition+11
🗂️Data StructureIntermediate
Segment Tree with Lazy Propagation
A segment tree with lazy propagation supports fast range updates and range queries in O(\log n) time.
#segment tree#lazy propagation#range update+12
🗂️Data StructureIntermediate
Fenwick Tree - Range Update Range Query
A Fenwick Tree (Binary Indexed Tree) can support range additions and range sum queries by maintaining two trees, often called B1 and B2.
#fenwick tree#binary indexed tree#range add+12