One: Knowledge points
Data structure:
1, single and double linked lists and circular linked lists
2, tree representation and storage, binary tree (concept, traversal) binary tree
Application (binary sort tree, decision tree, game tree, solution tree, etc. )
3. File operation (reading data from a text file and outputting it to a text).
In the work)
4, graphics (basic concepts, storage structure, graphics operation)
mathematical knowledge
1, the application of discrete mathematical knowledge (such as permutation and combination, simple graph theory, number
Logic)
2. Knowledge of number theory
3. Linear Algebra
4. Combinatorial Algebra
5. Computational geometry
Two algorithms
1, sorting algorithm (throwing method, insert sorting, merge sorting, quick sorting)
Sequence, heap sort)
2. Search (sequential search, twice allocation)
3, backtracking algorithm
4. Recursive algorithm
5. Divide and conquer algorithm
6. Simulation method
7, greed law
8, simple search algorithm (depth first, breadth first), in the search
Pruning, A* algorithm
9. The idea and basic algorithm of dynamic programming.
10, high precision operation
Thirdly, the problem analysis in ACM competition.
There are only 16 kinds of programming in general competitions, namely:
Dynamic programming (dynamic programming)
Greed (greedy algorithm)
Full search (exhaustive search)
Flood filling (I don't know how to translate)
Shortest path (shortest path)
Recursive search technology (backtracking search technology)
Minimum Spanning Tree (Minimum Spanning Tree)
Knapsack (knapsack problem)
Computational geometry (computational geometry)
Network flow (network flow)
Euler path (Euler path)
Two-dimensional convex hull
Large number problem
Heuristic search (heuristic search)
Approximate search (approximate search)
Temporary problems (miscellaneous problems)
Four ACM competition reference books
Practical algorithm analysis and programming (Wu,,, Electronic Industry Press, Competition Black Book).
Guide to the Youth International and National Informatics (Computer) Olympic Competition-Combinatorial Mathematical Algorithm
And programming (published by Wu, Tsinghua University Publishing House, and required to learn combinatorial mathematics in the competition).
Computer algorithm design and analysis (edited by Wang Xiaodong, the best data structure textbook)
Data Structure and Algorithm (edited by Fu and Wang Xiaodong, the best algorithm textbook I have ever seen)
Guidance of Informatics Olympic Games —— 1997- 1998 Test Analysis (Wu, Tsinghua University Publishing House).
"Computer Programming Skills" by D.E.Kruth, the most famous "Sunflower Collection" in the algorithm book, a master's work, difficult)
Zhou Peide's computational geometry
ACM acm acm international collegiate programming contest Examination Questions and Analysis (I) (Author Wu, Tsinghua University Publishing House)
Ye, editor-in-chief of three training materials for mathematical modeling competition.
Jiang Qiyuan, Mathematical Model, Second Edition
stochastic programming
fuzzing mathematics
Introduction to Mathematical Modeling Xu Quanzhi
Design and Analysis of Computer Algorithms in National University of Defense Technology
Five common online question banks
Commonly used websites:
1) Home for Informatics Beginners:
(2) Big banyan programming world:
(3) China Education Dawn Network:
(4) Fujian Information Olympics:
(5) 20th National Youth Informatics Olympic Competition:
(6) 15 international youth informatics Olympic competition;
(7) National Computer Olympics Competition:
(8) official website, American Informatics Olympiad:
(9) Ural State University of Russia:
(10) Valladolid Football Club University:
( 1 1)ICPC ACM:
(12) Peking University:
(13) Zhejiang University:
( 14)IOI:
(15)2003 Jiangsu Informatics Olympic Competition Summer Camp;
( 16)
( 17)
( 18)
( 19)
Colin Fox/Colin Fox
How to prepare ACM/ICPC
1, personal preparation (algorithm book, problem set, online problem solving discussion)
2 1000 question = Asian champion = world final
3, do a good job of data collection and sorting.