English version is in beta. All contents of the site should be already translated (mostly using machine translation), and everything should work properly. However, if you find any problems, please contact me.
Level 9B
To advance to the next level, you need to solve all problems.
Games on cyclic graphs
Cartesian tree (treap)
To begin with, read about binary search trees, well, or else here. You don't have to (yet) be able to write them, but just understand what it is and how it works.
Theory on e-maxx
Theory on the ITMO website
You can still Google
Disjoint set union and the minimal spanning tree
See the corresponding lecture of Parallel A'
See the lectures "DSU" and "Spanning trees" from SIS.2008.B'
Theory on e-maxx:
- DSU
- Kruskal 's algorithm
- How to use DSU in Kruskal's algorithm
- Prim's algorithm
algoprog.ru © Petr Kalinin, GNU AGPL, github.com/petr-kalinin/algoprog | About the license for the site materials | Blog (in Russian)