Guide to Competitive Programming : Learning and Improving Algorithms Through Contests

✍ Scribed by Antti Laaksonen

• Publisher: Springer International Publishing
• Year: 2024
• Tongue: English
• Leaves: 367
• Edition: 3
• Category: Library

✦ Synopsis

This textbook features new material on advanced topics, such as calculating Fourier transforms, finding minimum cost flows in graphs, and using automata in string problems. Critically, the text accessibly describes and shows how competitive programming is a proven method of implementing and testing algorithms, as well as developing computational thinking and improving both programming and debugging skills.
Topics and features
Introduces dynamic programming and other fundamental algorithm design techniques, and investigates a wide selection of graph algorithms
Compatible with the IOI Syllabus, yet also covering more advanced topics, such as maximum flows, Nim theory, and suffix structures
Provides advice for students aiming for the IOI contest
Surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming
Examines the use of the Python language in competitive programming

✦ Table of Contents

Cover
Front Matter
1. Introduction
2. Programming Techniques
3. Efficiency
4. Sorting and Searching
5. Data Structures
6. Dynamic Programming
7. Graph Algorithms
8. Algorithm Design Topics
9. Range Queries
10. Tree Algorithms
11. Mathematics
12. Advanced Graph Algorithms
13. Geometry
14. String Algorithms
15. Additional Topics
16. Python in Competitive Programming
17. Preparing for IOI
18. Future of Competitive Programming
Back Matter