Guide to Competitive Programming: Learning and Improving Algorithms Through Contests

Description

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many “folklore” algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers. Front Matter ....Pages i-xii Introduction (Antti Laaksonen)....Pages 1-7 Programming Techniques (Antti Laaksonen)....Pages 9-25 Efficiency (Antti Laaksonen)....Pages 27-36 Sorting and Searching (Antti Laaksonen)....Pages 37-49 Data Structures (Antti Laaksonen)....Pages 51-62 Dynamic Programming (Antti Laaksonen)....Pages 63-75 Graph Algorithms (Antti Laaksonen)....Pages 77-106 Algorithm Design Topics (Antti Laaksonen)....Pages 107-117 Range Queries (Antti Laaksonen)....Pages 119-129 Tree Algorithms (Antti Laaksonen)....Pages 131-146 Mathematics (Antti Laaksonen)....Pages 147-187 Advanced Graph Algorithms (Antti Laaksonen)....Pages 189-209 Geometry (Antti Laaksonen)....Pages 211-224 String Algorithms (Antti Laaksonen)....Pages 225-237 Additional Topics (Antti Laaksonen)....Pages 239-268 Back Matter ....Pages 269-283