"ACM Algorithm Outline" "Transfer from ALPC"

Basic	C + +, STL (vector, set, map, queue, string, algorithm) Enumeration, greed, recursion, division, recursion, simulation Construction, bitwise operations, constant optimization
Data	Queue, heap, stack, linked list Sort (insert, bubble, fast, merge, heap, bucket, cardinality) Binary search, hash list, and check set, Huffman tree Sort binary tree, left bias tree, balance tree (SPLAY/TREAP/SBT) Tree array, Segment tree, merge tree, tree, tree tree Tree chain split, dynamic tree 1/2-D RMQ, LCA (online/offline), sparse tables, dictionary trees
String	KMP, extended KMP AC Automatic Machine Suffix tree, suffix array, suffix automaton LCP randomization algorithm Minimal notation
Search	DFS, BFS, pruning, bi-directional wide search Iterative deepening, A *, id-a* Dancing-links Climbing method, simulated annealing, genetic algorithm
Mathematical	Binary conversions, expression evaluation Two points, three points Probability theory, calculus High accuracy (subtraction mold) High-precision real numbers, fractions Fast power, matrix, matrix chain multiplication Polynomial seeking root and Newton iteration Solving linear equations with Gaussian elimination element Combinatorial math, permutation and combination count Principle of tolerance, drawer principle, Mobius inversion Permutation group, Burnside Lemma, Polya theorem, female function Cattleya number, Sterling number Fourier transform (large number multiplication) Two-element linear programming with semi-planar intersection solution and linear programming with simplex method Joseph question 0/1 Fractional Planning
Arithmetical	GCD, Extended Euclid Determination of prime number and prime number by sieve method Congruence equation and Chinese remainder theorem Large prime number test, decomposition Euler function, integrable function, flange sequence inverse element, discrete logarithm
Graph theory	Basic concepts (Dfs spanning tree top, bridge, cut point, cut, double connected component) Representation of graphs (matrices, adjacency tables) Shortest Circuit (Dijkstra (+HEAP), Floyd, Bellmen-ford, SPFA), transitive closures Minimum spanning tree Strong Unicom component (+ pinch point) Topological sorting Two connected components of bridge and Edge and their properties Cut point, point double connected component Degree limit spanning tree, sub-niche tree, optimal scale spanning tree Minimum tree diagram Short Circuit (Dijkstra), K short Circuit (A *) Differential constraint system 2-sat Euler path (Loop), Hamilton Road (Loop) Network streams (SAP, dinic) Maximum flow minimum cut, floor plan minimum cut, global minimum cut stoer-wagner algorithm Minimum cost maximum flow Network flow with traffic to the upper and lower bounds (expense flow) Non-Yuanhui network flow The matching of binary graph and the maximum weights of binary graphs Any intent match (with Flower tree) Most powerful closed sub-graphs, maximum density sub-graphs Maximum group, maximum independent set
Calculate geometry	Basic operation: Cross product, dot product Vector translation, rotation Judgment and intersection of line segments (lines, rays) intersection Point, line, line, plane relation, distance Point inside/out/on polygon Polygon Circumference, area Two-dimensional convex bag Nearest point pair, nearest round pair Rotating Jam Calculation distance: Convex polygon diameter, shape width, maximum and minimum distance between convex polygon Outside rectangle: Minimum perimeter, minimum area outside rectangle Triangulation: onion, spiral, quadrilateral split Convex polygon Properties: Bump Merge, find Gongsche, critical tangent, convex polygon intersection, convex polygon vector, and Thinnest cross section: Thinnest cross-sectional band Triangle Spherical distance Basic operation of three-dimensional geometry Vector translation, rotation Point, line, polygon Three-dimensional convex bag Minimum cover circle for a point set Maximum Hollow Rectangle Round area of intersection/and The position relationship between circle and Circle The relationship between circle and segment, Polygon, area Semi-planar Cross Self-adapting Simpson formula Steiner Spanning Tree
Dynamic planning	Memory Search Longest common sub-sequence Longest ascending sequence Backpack Ninth Lecture (0/1, complete, dependent, grouped, generalized items) Quadrilateral inequality optimization, slope optimization, monotonic queueing (1D\1D) Data structure optimization (segment tree optimization, heap optimization, left-biased tree optimization) Tree-type DP, automatic DP Digital DP, state compression DP, plug DP, generalized plug (Minimum representation)
Game theory	Bash Game, Wythoff game NIM, SG functions Search, very small search The game of non-direction graph and cut edge
Other	Calendar, date Hanoi Discretization of Find the Rules Play table

"ACM Algorithm Outline" "Transfer from ALPC"