Module contest_algorithms::range_query

Re-exports

pub use dynamic_arq::ArqView;

pub use dynamic_arq::DynamicArq;

pub use specs::ArqSpec;

pub use static_arq::StaticArq;

Modules

dynamic_arq	Associative Range Query Tree with dynamic allocation, supporting sparse initialization and persistence
specs	A collection of example ArqSpec implementations
sqrt_decomp	A generic implementation of Mo's algorithm, aka Query Sqrt Decomposition. It answers q offline queries over intervals in 0..n by shifting the query interval's endpoints by one position at a time. Each endpoint incurs a total cost of at most n * sqrt(q * L_OP * R_OP).
static_arq	Associative Range Query Tree