Concepts2
⚙️AlgorithmIntermediate
Binary Search
Binary search quickly finds targets or boundaries in sorted or monotonic data by halving the search interval each step.
#binary search#lower_bound#upper_bound+11
🗂️Data StructureAdvanced
Dynamic Segment Tree
A dynamic segment tree stores values over a huge coordinate range by creating nodes only when an operation touches their interval.
#dynamic segment tree#sparse segment tree#lazy propagation+12