Collection of different algorithms, used for programming competitions like ACM ICPC.
Algorithms are divided by topic. Most algorithms are runnable from the file as is. Every algorithm has a reference problem on which it was tested, and some notes about its time and space complexity.
Feel free to use for any purposes (you may contact authors before, if you feel like it).
For any suggestions, corrections or questions contact adilet@adilet.org or open issue and/or pull request here.
- Convex Hull trick – Convex Hull trick is a geometry based dynamic programming modification. More about it.
- Longest Increasing Sequence – Fast way to find longest increasing subsequence (subsequence in which each next element is greater than previous).
- Cartesian Tree – Cartesian tree is a randomized balanced binary search tree.
- Cartesian Tree with implicit keys – Cartesian tree with implicit keys is a powerful modification of cartesian tree, which can be used to solve many interesting problems. This implementation solves the problem of finding range minimum and also can perform reverse of an array segment.
- Fenwick tree – Fenwick tree is a simple and easy-to-write data structure which can be used to find the value of some reversible function on the interval and also change the value of some element. This implementation can find the sum on the interval and update any arbitrary element.
- Fenwick tree 2D – Extension of Fenwick tree on 2D case. This code can find the sum on the rectangle and update any arbitrary element.
- Implicit segment tree – Implicit segment tree is a modification of segment tree which creates nodes only when they are needed. It can be used on big intervals like [1..109]. This code performs addition on the interval and getting the value of some element.
- Queue with minimum – Modification of queue, which allows finding the minimum element in it.
- Segment Tree (Assign-Sum) – Segment tree is a powerful data structure which can perform many operations on the intervals in O(logN) time. This implementation performs assignment and gets the sum on the interval.
- Segment Tree (minimum on a segment and update) – Segment tree. Solves RMQ problem (maximum on a segment and value update).
- Sparse table – Solves static RMQ problem (range minimum/maximum query without element changes).
- Closest pair of points (Code 2) – Divide-and-conquer approach to find the closest pair of points.
- Convex Hull (Code 2) – Graham-Andrew and Graham scan methods to find convex hull (the least convex polygon containing all given points).
- Bellman-Ford algorithm – Bellman-Ford algorithm finding shortest distances from a single vertex in graph.
- Bipartite matching – Kuhn algorithm for maximum matching in bipartite graph.
- Bridges search – Algorithm for finding all bridges in the graph (edges, after removal of which graph divides into several components).
- Cutpoints search – Algorithm for finding all cutpoints in the graph (vertices, after removal of which graph divides into several components).
- Dijkstra algorithm (set version) – Finding minimum distances from the single source with Dijkstra algorithm. No negative edges are allowed. Best for sparse graphs. Two versions using set and heap.
- Dinic maxflow – Dinic algorithm with scaling for finding the maximum flow.
- Eulerian path/cycle – Algorithm for finding the Eulerian path/cycle, i.e. path/cycle that visits every edge of the graph exactly once.
- Floyd-Warshall algorithm – Floyd-Warshall algorithm finding shortest distance between all pairs of vertices in graph.
- Ford-Fulkerson maxflow – Ford-Fulkerson algorithm for finding the maximum flow.
- Heavy-light decomposition – Heavy-light decomposition with segment trees in paths. Used for finding maximum on the path between two vertices.
- Hungarian matching – Hungarian algorithm for solving the assignment problem.
- LCA. Binary ascent. – Finding LCA (Least common ancestor) of two vertices in the tree. Uses dp calculated on powers of 2.
- LCA. Heavy-light decomposition. – Finding LCA (Least common ancestor) of two vertices in the tree. Uses heavy-light decomposition.
- MinCost MaxFlow Dijkstra (Heap Dijkstra) – Solution to MinCost MaxFlow (or simply MinCost Flow) using Dijkstra algorithm with potentials as shortest path search method.
- MinCost MaxFlow Ford-Bellman – Solution to MinCost MaxFlow (or simply MinCost Flow) using Ford-Bellman algorithm as shortest path search method.
- Minimum spanning tree. Kruskal algorithm – Kruskal algorithm for finding the minimum spanning tree (tree connecting the given graph with minumim sum of edges).
- Minimum spanning tree. Prim algorithm – Prim algorithm for finding the minimum spanning tree (tree connecting the given graph with minumim sum of edges).
- BigInt – Structure implementing long arithmetic in C++. Analogous to BigInteger in Java.
- Catalan numbers – Finding Nth Catalan number modulo some mod (mod is not necessary prime). Uses Eratosthenes sieve for fast factorization.
- Diophantine equation – Solving Diophantine equations in form of a * x + b * y = c. Uses extended Euclid algorithm (which finds such x, y that a * x + b * y = gcd(a, b)).
- Fast Fourier transformation – Fast Fourier transformation used to multiply long numbers. Fast non-recursive version.
- Gauss – Gauss method of solving systems of linear algebraic equation.
- Number by permutation – Finding number of permutation in lexicographical order.
- Permutation by number – Finding permutation by its length and number in lexicographical order.
- Expression result calculation – Calculation of the value of the algebraic expression (like 2 * (5 + 7) - 25 / 5). Uses recursive descend. See code for the list of supported operations.
- Merge sort – Merge sort for sorting the array of integers.
- Quick sort – Quick sort with random pivoting for sorting the array of integers.
- Radix sort – Radix sort for sorting the array of integers.
- Aho-Corasick – Aho-Corasick algorithm. This code finds all words in the text that contain any of the initially given words.
- Hashing – Hashing in strings based problems. This code compares substrings using two hashes (one uses 2^64 as a modulo, another 10^9 + 7).
- Manacher's algorithm – Manacher's algorithm for finding all subpalindromes in the string.
- Palindrome tree – Useful structure to deal with palindromes in strings. This code counts number of palindrome substrings of the string.
- Prefix function – Calculating the prefix function of the given string.
- Suffix Array – Building suffix array in O(NlogN). Also LCP array is calculated. This code counts number of different substrings in the string.
- Trie – Builds trie (tree with characters on the edges) from the set of strings. This code counts number of different substrings in the string.
- Suffix Tree. Ukkonen's algorithm – Ukkonen's algorithm for building the suffix tree. Uses sibling lists in the nodes. This code counts number of different substrings in the string.
- Z function – Calculating the Z-function of the given string.