OBI Practice Questions - Olimpíada Brasileira De Informática Exam

A Max-Heap (priority queue) that pops and pushes elements during a nested linear scan of remaining items A balanced Binary Search Tree (such as std::set) storing all elements and querying upper_bound for each element A monotonic decreasing stack that processes array elements from right to left, popping smaller elements before recording the top A Disjoint Set Union (DSU) structure initialized with N singleton sets, performing union operations on adjacent indices