Codebook

Data structures and algorithms for International Collegiate Programming Contest (ICPC) and other contests about competitive programming.

Some of codes are implemented by me, the most part in C++.

PDF Version

Link to PDF Version

References

• E-Maxx Algorithms
• Geeks for Geeks

Contents

Data Structures

• Segment Tree
  • Segment Tree (Standard)
  • Segment Tree Lazy Propagation
  • Segment Tree Range Update Point Query
  • Merge Sort Tree
• Fenwick Tree
  • Fenwick Tree
• Sqrt Decomposition
• Disjoint Set Union
• Query Queue
• Query Stack
• Sparse Table

Graph's Algoritms

• Bridges
• Cutpoints
• Kosaraju
• LCA with Binary Lifting
• Euler Tour
• Eulerian Path
• Heavy-Light Decomposition - Edges
• Heavy-Light Decomposition - Nodes
• SPFA
• Maximum Flow

Math

• Basic Math
• Modular Arithmetic
• Factorial
• Prime Number and Factorization
• Matrix
• Gauss Elimination
• Extended Euclidean

Dynamic Programming

• PSA PA

Geometry

• Basic Geometry
• Convex Hull
• Convex Polygon

String's Algorithms

• Prefix Function (KMP)
• Z Function
• String Hashing
• Trie
• Trie Int
• Aho Corasick
• Suffix Array
• Manacher
• Lyndon Factorization

Miscellaneous

• Ternary Search
• Longest Increasing Subsequence (LIS)
• Mo's Algorithm
• Inversions Count