Function contest_algorithms::arq_tree::first_negative

pub fn first_negative(arq: &mut ArqTree<AssignMin>) -> i32

An example of binary search on an ArqTree. In this case, we use RMQ to locate the leftmost negative element. To ensure the existence of a valid root note (i == 1) from which to descend, the tree size must be a power of two.