Getting Started with basic algorithms

1. Greedy, recursive, basic DP (backpack, interval DP, state compression DP (not less than 2 bronze issues last year, see))

2. Search (bfs,dfs,a*,ida*)

3. Monotone queue, monotone stack idea, multiplication algorithm (ST table) (key left 3 things in DP optimization application, briefly talk about parallelogram principle, slope optimization)

4. Segment tree, tree-like array

5. Tree (including and check set, spanning tree, tree of some classical problems (LCA, here by the way, the depth of the tree to the interval problem), the classic count (tree DP))

6. Graph theory Basic problems (topology ordering of DAG graphs, Shortest path algorithm FLOYD,DIJSTRA,SPFA (here is the difference constraint and fractional planning))

7. Matching (binary map (with right) matching (main Hungary, KM, by the way, refer to the HK algorithm), general diagram matching (mentioned can)), focusing on the binary diagram of the various matching

8. Maximum flow, minimum cut (classic model, checkerboard model to be introduced), the upper and lower bounds mentioned can be

9. Simple Mathematics (extended gcd (solving linear equations), Chinese remainder theorem, prime sieve method, Euler's theorem, Euler's function)

10. Two points (basic monotonicity lookup, matrix (Fast Power)), three points

11. Basic probability model and Gaussian elimination element

12. Simple Geometry (dot product, cross product, segment intersection, convex hull, etc.)

13. Game (Nim and model, other common models, the idea of symmetric games)

14. String 1 (KMP, extended KMP (z-function), minimum representation of the string, Manacher)

15. String 2:trie tree, Trie diagram (AC automaton)

16. String 3: Suffix array

Listed, can be focused, but the basic concepts must be universal. Because it is for some 12 class and 13 students to popularize the idea of the algorithm, so please at the end of each talk, in the Hust VJ on the corresponding topic of the virtual competition, requirements: The entry question has 2-3 (template what), followed by a few Daojing questions

For the students to listen to the requirements, because basically, 2-3 topics is a week, so the entry question must be over, advanced questions to choose to do or not to do, but requires at least 3 topics are in-depth. At the same time, the question-makers should give a simple question.

The above is the special requirements of Ly brother, this phase I intend to follow the requirements of a topic a special breakthrough, the common algorithms and ideas have a basic understanding, the first will do the basic problems of these topics, and then gradually transition to the next step, please pay attention to ....

Getting Started with basic algorithms