Min-max Heap - Wikipedia
In computer science, a min-max heap is a complete binary tree data structure which combines the usefulness of both a min-heap and a max-heap, that is, it provides constant time retrieval and logarithmic time removal of both the minimum and maximum elements in it. This makes the min-max heap a very useful data structure to implement a double-ended priority queue.
Splay Tree - Wikipedia
A splay tree is a binary search tree with the additional property that recently accessed elements are quick to access again. Like self-balancing binary search trees, a splay tree performs basic operations such as insertion, look-up and removal in O(log n) amortized time. For many sequences of non-random operations, splay trees perform better than other search trees, even …
Things I Don't Know - Codeforces
Calling that a proof is too much, you didn't even mention you're sorting in decreasing order and also didn't define tout. After thinking a bit about this I also realized you use Korasaju's algorithm so you also have to understand most people use Tarjan's algorithm because it's way shorter to implement (and there's no need to reverse the graph).
Open Thread – New Year 2022 – New Catallaxy
Jan 03, 2022 · The day will eventually come, when someone posts a brief comment about a suburb, town, event, obscure village abandoned 70yrs ago, for which Ed Case does not have a personal ‘insider knowledge’ anecdote. Y’all keep reading the Cat, one of these days it will happen. Report comment