About ACM and OJ

Elementary:

I. Basic Algorithms:
(1) enumeration. (poj1018, poj1753, poj2965)
(2) greedy (poj1328, poj2109, poj2586)
(3) recursion and divide and conquer.
(4) recurrence.
(5) constructor. (poj3295, poj3239)
(6.1) simulation method. (poj1008, poj1068, poj2632, poj1573, poj2993, poj2996, poj3087)

(6.2) simulation method (high-precision algorithm) (poj1001, poj1503, poj2389, poj2602, poj3982, 21-digit daffodils)
Ii. Graph Algorithm:
(1) depth first traversal and breadth first traversal.
(2) shortest path algorithm (Dijkstra, Bellman-Ford, Floyd, heap + Dijkstra)
(Poj1860, poj3259, poj1062, poj2253, poj1125, poj2240)
(3) Minimum Spanning Tree Algorithm (Prim, Kruskal)
(Poj1789, poj2485, poj1258, poj3026)
(4) topological sorting (poj1094)
(5) maximum matching of bipartite graphs (Hungary algorithm) (poj3041, poj3020)
(6) augmented Path Algorithm for the maximum stream (press-in duplicate mark method, KM algorithm). (poj1459, poj3436)
Iii. data structure.
(1) string (poj1016, poj1035, poj3080, poj1936)
(2) sorting (fast sorting, Merge Sorting (related to the number of reverse orders), heap sorting) (poj1007, poj2388, poj1804, poj2299)
(3) Simple and query set applications.
(4) efficient search methods such as hash table and binary search (number hash, string hash)
(Poj1002, poj3349, poj3274, poj1840, poj2002, poj3432, poj2503)
(5) priority queue (poj3253)
(6) Heap
(7) trie tree (static and dynamic) (poj2513)
4. Simple search
(1) Deep Priority Search (poj2488, poj3083, poj3009, poj1321)
(2) breadth-first search (poj3278, poj1426, poj3126, poj3414, poj2.pdf)
(3) simple search techniques and pruning (poj1010, poj21_, poj1011, poj1416, poj2676, poj1129)
5. Dynamic Planning
(1) backpack problems. (poj1837, poj1276, poj1014)
(2) Simple DP in the following table (refer to page149 in lrj ):

1. E [J] = opt {d + W (I, j)} (poj3267, poj1836, poj1260, poj2533)
2. E [I, j] = opt {d [I-1, J] + Xi, d [I, J-1] + YJ, d [I-1] [J-1] + zij} (longest common subsequence)
(Poj1015, poj3176, poj1163, poj1080, poj1159)
3. c [I, j] = W [I, j] + opt {C [I, k-1] + C [K, J]}. (optimal binary search tree problem)
6. Mathematics
(1) combined mathematics:
1. Principle of addition and multiplication.
2. Arrange and combine.
3. Recursive relationship.
(Poj1012, poj3252, poj1850, poj1496, poj1019, poj1942)
(2) number theory.
1. Prime Number and Division
2. hexadecimal digits.
3. Same modulus operation.
(Poj2305, poj2635, poj3292, poj1845, poj2115)

4. logical reasoning.

(Poj1013, poj1017)

4. Chinese Remainder Theorem (poj1006)
(3) calculation method.
1. Knowledge about monotonic functions in the binary method. (poj3273, poj3258, poj1905, poj3122)

(4) randomization algorithm (poj2531)

(5) probability (poj2151)
VII. computational geometry.
(1) geometric formula.
(2) Use of cross products and dot products (for example, determination of intersection of line segments and distance between points and line segments). (poj2031, poj1039)
(3) simple multi-edge algorithm (area calculation) and correlation determination (whether the multi-edge is in the Multi-edge type and whether the multi-edge type is intersection)
(Poj1408, poj1584)
(4) convex hull. (poj1696, poj2187, poj1113)

 

Intermediate:

I. Basic Algorithms:
(1) Application of C ++ standard template library (poj3096, poj3007)
(2) Training of complex simulation questions (poj3393, poj1472, poj3371, poj1027, poj2706, poj1009)
Ii. Graph Algorithm:
(1) Establishment and Solution of a differential constraint system (poj1716, poj1201, poj2983)
(2) Maximum Minimum fee stream (poj2516, poj2195)
(3) connected component (poj2942)
(4) strongly connected branches and their shrinkage points (poj2186)
(5) cut edge and cut point of a graph (poj1523, poj3352, poj3177)
(6) Minimum Cut model and network flow protocol (poj3308)
Iii. data structure.
(1) Line Segment tree. (poj2528, poj2828, poj2777, poj2886, poj2750)
(2) Static Binary Search Tree (poj2482, poj2352)
(3) TREE tree group (poj1195, poj3321)
(4) rmq. (poj3264, poj3368)
(5) advanced applications of the query set. (poj1703, 2492)
(6) KMP algorithm. (poj1961, poj2406)
4. Search
(1) optimal pruning and feasible pruning
(2) Search Skills and optimization (poj1020, poj3411, poj1724)
(3) memory-based search (poj3373, poj1691)

(4) Search and State compression (poj1184)

5. Dynamic Planning
(1) more complex dynamic planning (such as dynamic planning to solve special operator problems)
(Poj1191, poj1054, poj3280, poj2029, poj2948, poj1925, poj3034)
(2) Dynamic Planning of record status (poj3254, poj2411, poj1185)
(3) tree-based Dynamic Planning (poj2057, poj1947, poj2486, poj3140)
6. Mathematics
(1) combined mathematics:
1. Refresh principle.
2. Drawer principle.
3. Group replacement and polyA theorem (poj1286, poj2409, poj3270, poj1026 ).
4. Recurrence relationship and primary function.

(2) mathematics.
1. Gaussian elimination method (poj2947, poj1487, poj2065, poj1166, poj1222)
2. Probability Problem. (poj3071, poj3440)
3. GCD, Extended Euclidean (Chinese Remainder Theorem) (poj3101)
(3) calculation method.
1.0/1 score planning. (poj2976)
2. The three-way method is used to solve the extreme values of a single peak (single Valley.
3. Matrix Method (poj3150, poj3422, poj3070)
4. iterative approximation (poj3301)
(4) randomization algorithm (poj3318, poj2454)
(5) Miscellaneous questions.
(Poj1870, poj3296, poj3286, poj1095)
VII. computational geometry.
(1) Coordinate discretization.
(2) scanning line algorithm (for example, finding the area and perimeter of a rectangle and using it with a line segment tree or heap ).
(Poj1765, poj1177, poj1151, poj3277, poj2280, poj3004)
(3) polygon kernel (semi-plane intersection) (poj3130, poj3335)
(4) comprehensive application of geometric tools (poj1819, poj1066, poj2043, poj3227, poj2165, poj3429)

 

Advanced:

I. Basic algorithm requirements:
(1) the code can be quickly written in a concise but elegant style.
(Poj2525, poj1684, poj1421, poj1048, poj2050, poj3306)
(2) ensure correctness and efficiency. poj3434
Ii. Graph Algorithm:
(1) minimum generation tree and minimum K short circuit. (poj1639)
(2) theory of the maximum short circuit, Minimum Spanning Tree, bipartite graph, and maximum flow problem (mainly modeling and solving)
(Poj3155, poj2112, poj1966, poj3281, poj1087, poj2289, poj3216, poj2446
(3) optimal rate spanning tree (poj2728)
(4) minimum tree structure (poj1_4)
(5) generate small trees.
(6) Minimum ring of undirected graph and Directed Graph
Iii. data structure.
(1) trie graph creation and application (poj2778)
(2) The LCA and rmq problems (the recent common ancestor problems) include offline algorithms (parallel query set + DFS) and online algorithms.
(Rmq + DFS). (poj1330)
(3) Dual-end queue and Its Application (maintaining a monotonous queue, often in the dynamic planning from optimization status transfer
Purpose). (poj2823)
(4) left Tree (merged heap ).
(5) suffix tree (a very useful data structure is also a hot topic in the competition area ).
(Poj3415, poj3294)
4. Search
(1) troublesome search question training (poj1069, poj3322, poj1475, poj1924, poj2049, poj3426)
(2) wide search status optimization: using M-in-number Storage status, converting to string hash table Weight Determination, bit compression storage status, bidirectional wide search, A * algorithm. (poj1768, poj1184, poj1872, poj1324, poj2046, poj1482)
(3) Optimization of Deep Search: Bit operations should be used as much as possible, pruning must be required, as few function parameters as possible, and the number of layers is not too large. You can consider bidirectional search, rotation search, and IDA * algorithms. (poj3131, poj2870, poj2286)
5. Dynamic Planning
(1) dynamic planning that requires data structure optimization.
(Poj2754, poj3378, poj3017)
(2) quadrilateral inequality theory.
(3) difficult status dp (poj3133)
6. Mathematics
(1) combined mathematics.
1. Mobius Inversion (poj2888, poj2154)
2. Partial Order relationship theory.
(2) forum discussion.
1. Extremely small processes (poj3317, poj1085)
2. Nim problems.
VII. computational geometry.
(1) Semi-plane intersection (poj3384, poj2540)
(2) create a visual image (poj2966)
(3) Minimum circular coverage of a point set.
(4) vertex (poj2079)
8. Comprehensive questions.
(Poj3109, poj1478, poj1462, poj2729, poj2048, poj3336, poj3315, poj2148, poj1263)

Thank you http://blog.csdn.net/lyy289065406/article/details/6642573

About ACM and OJ