Function contest_algorithms::range_query::dynamic_arq::first_negative

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

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.