Library that contains different implementations of algorithms, data structures and other techniques used for solving many competitive programming contests.
Some of the unique implementations that can be found in this library:
- Persistent Segment Tree implementation
- Treap implementation
- Centroid Decomposition implementation
- Divide and Conquer optimization for Dynamic Programming problems.