contest_algorithms::range_query::dynamic_arq

Function first_negative

Source 
pub fn first_negative(
    arq: &mut DynamicArq<AssignMin>,
    view: ArqView,
) -> Option<i64>
Expand description

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.