[−][src]Module contest_algorithms::range_query::dynamic_arq
Associative Range Query Tree with dynamic allocation, supporting sparse initialization and persistence
Structs
DynamicArq | A dynamic, and optionally persistent, associative range query data structure. |
DynamicArqNode |
Functions
first_negative | An example of binary search to find the first position whose element is negative. The DynamicArq version works on trees of any size, not necessarily a power of two. |
Type Definitions
ArqView |