Difference between revisions of "Standard Library"
Jump to navigation
Jump to search
| Line 10: | Line 10: | ||
* [[Binary-Indexed Tree]] | * [[Binary-Indexed Tree]] | ||
* [[Segment Tree]] | * [[Segment Tree]] | ||
| + | * [[Sparse Table]] | ||
* [[Heap]] | * [[Heap]] | ||
* [[Self-Balanced BST]] | * [[Self-Balanced BST]] | ||
* [[Persistence Data Structures]] | * [[Persistence Data Structures]] | ||
| + | * [[Link-Cut Tree]] | ||
== Graph Theory == | == Graph Theory == | ||
| Line 48: | Line 50: | ||
* [[Longest Common Sequence]] | * [[Longest Common Sequence]] | ||
* [[Area and Circumference Union]] | * [[Area and Circumference Union]] | ||
| + | * [[Mo's Algorithm]] | ||
== String Processing == | == String Processing == | ||
* [[KMP and Aho-Corasick Automaton]] | * [[KMP and Aho-Corasick Automaton]] | ||
| − | * [[Suffix array and Suffix Automaton]] | + | * [[Suffix array and Suffix Automaton(Suffix Tree)]] |
* [[Manacher and Palindrome Automaton]] | * [[Manacher and Palindrome Automaton]] | ||
* [[String Hash]] | * [[String Hash]] | ||
Revision as of 12:19, 6 March 2018
Java
Calculation
Data Structures
- Binary-Indexed Tree
- Segment Tree
- Sparse Table
- Heap
- Self-Balanced BST
- Persistence Data Structures
- Link-Cut Tree
Graph Theory
- Connected Component
- 2-SAT
- Bipartite Graph
- Network Flow
- Maximal Clique
- Perfect Elimination Ordering
- Tree and Graph Isomorphism
Linear Algebra
Number Theory
- Multiply, Power and Inverse
- Extended Euclid
- Chinese Remainder Theorem
- Primitive Root
- Quadratic Residue and Discrete Roots
- Discrete Logarithm
- Miller-Rabin
Others
- Date Magic
- Permutation Rank
- Expression Parsing
- Kth Number
- Longest Common Sequence
- Area and Circumference Union
- Mo's Algorithm