"Sticky" ACM Knowledge points Classification

ACM Classification of Knowledge points

(Red: Have never heard of the yellow: heard of green: have been exposed to do the title blue: very familiar with the brush theme purple: See a second together)

First Class: Basic algorithm

(1) Basic algorithm: enumeration , greedy , recursive , split , recursive , construction , simulation

(2) Dynamic Planning: knapsack problem , tree dp, state compression DP, monotonic optimization , plug DP

(3) Search: Dfs,BFS, memory search , optimization and pruning , double wide , a*,ida*, dance chain

Class II: Data Structures

(1) simple data structure: list, stack and queue , string , tree and two fork tree , graph , sort and retrieve

(2) tree-shaped structure: segment Tree , tree-like array , dictionary tree , stretch tree , left-leaning tree, dynamic tree ,lca&rmq, partition tree ,SBT

(3) string: KMP,ac automaton , suffix array , minimum notation

(4) Other: and check set , hash list , block linked list, doubly linked list

Category III: Graph theory

(1) Shortest way: Dijkstra,bellman-ford (SPFA optimization), Floyd,heap+dijkstra, differential constraint, K shortest path

(2) Spanning Tree: Prim,kruskal, Degree limit minimum spanning tree, optimal ratio spanning tree, sub-niche tree, minimum tree diagram, count of spanning trees, tree division, enumeration of Trees

(3) Matching issues: maximum matching of binary graphs (Hungarian algorithm), Km,2-sat, isomorphic

(4) Network flow: Maximum flow , minimum cost maximum flow, minimum cut model, network flow protocol

(5) Other: topological sequencing, double-connected components, strongly connected branches and their shrinking points, cutting edges and cut points of graphs, undirected graphs, minimal loops of undirected graphs, Euler paths, Hamiltonian paths, floor plans, layered graphs, even graphs

Class Fourth: Mathematics

(1) Number theory: Prime and divide problems, carry system, same comodule arithmetic, integer factorization, GCD, extended Euclidean, solution to modal linear equations, Chinese remainder theorem, power of elements, RSA public key Cryptography

(2) Combinatorial Mathematics: Theory of addition and multiplication, permutation and combination, recursive relation and parent function, repulsion principle, drawer principle, permutation group and Polya theorem, Mobius inversion, partial order relation theories

(3) calculation method: The dichotomy method solves the monotone function related knowledge , the three-way solution solves the single-peak (valley) Extremum , the matrix method, the iterative approximation, the Gaussian elimination element method, the randomization algorithm, 0/1 fractional programming

(4) high-precision problem extension: To seek the reciprocal, to seek the right, to seek the root , to find the logarithm, the two-part fast method, the function of the finger, trigonometric, numerical calculation optimization

(5) Other: game theory, linear programming, integer programming, probabilistic problems, polynomial and fast Fourier, mathematical ideas and methods of comprehensive use (construction, conjecture, inductive method, disprove method)

Class Fifth: calculating geometry

(1) judge the intersection of the line segments, judge the line intersection, determine whether the point is within the polygon,

(2) Convex polygon Area & center of gravity calculation, seeking circumscribed circle and inner circle,

(3) finding convex hull, nearest point to problem, farthest point to problem,

(4) The minimum overlay circle for a point set or a collection of graphs, a minimum overlay rectangle for a point set or a collection of graphs,

(5) the intersection and the rectangle (scanning method),

(6) triangulation, calculation of Fermat points, pick theorem

(7) Common geometric formulas

(T_T)

"Sticky" ACM Knowledge points Classification