Zkw线段树 Exclusive [ Official ]

The ZKW segment tree has been widely used in competitive programming and has solved many problems in various domains, such as:

Time: $O(\log N)$ with very low constant. zkw线段树

The zkw segment tree is an elegant, highly efficient alternative to the classic recursive segment tree. Its iterative nature yields simpler code, lower constant factor, and smaller memory footprint. While it does not simplify lazy propagation, it excels in point update / range query scenarios and is an essential tool for performance‑sensitive applications. The ZKW segment tree has been widely used

In the world of competitive programming, data structures play a vital role in solving complex problems efficiently. One such data structure that has gained significant attention in recent years is the ZKW (Zhang-Kong-Wu) segment tree. Named after its creators, this powerful tool has revolutionized the way programmers approach range query problems. While it does not simplify lazy propagation, it

return sum;

Prefix sum [0, r] :

int lower_bound(int k) int pos = 1; while (pos < N) if (tree[pos<<1] < k) k -= tree[pos<<1]; pos = pos<<1 else pos = pos<<1;