دانلود کتاب Competitive Programming 4 - Book 1

فهرست مطالب :

Contents
Forewords for CP4
Bill Poucher
Miguel Revilla Rodríguez
Fredrik Niemelä
Brian Christopher Dean
Testimonials of CP1/2/3
Preface for CP4
Prerequisites
To (Aspiring) IOI Contestants
To Students of Data Structures and Algorithms Courses
To Job Seekers Preparing for IT Job Interview
To ICPC Contestants
To Teachers and Coaches
To All Readers
Convention
Problem Categorization
Changes for CP4
Supporting Websites
Copyright
Steven Halim, PhD 5
Felix Halim, PhD 6
Suhendry Effendy, PhD 7
Abbreviations
Introduction
1.1 Competitive Programming
1.2 The Competitions
1.3 Tips to be Competitive
1.4 Getting Started: The Easy Problems
1.5 Basic String Processing Skills
1.6 The Ad Hoc Problems
1.7 Solutions to Non-Starred Exercises
1.8 Chapter Notes
Data Structures and Libraries
2.1 Overview and Motivation
2.2 Linear DS with Built-in Libraries
2.3 Non-Linear DS with Built-in Libraries
2.4 DS with Our Own Libraries
2.5 Solution to Non-Starred Exercises
2.6 Chapter Notes
Problem Solving Paradigms
3.1 Overview and Motivation
3.2 Complete Search
3.3 Divide and Conquer
3.4 Greedy
3.5 Dynamic Programming
3.6 Solution to Non-Starred Exercises
3.7 Chapter Notes
Graph
4.1 Overview and Motivation
4.2 Graph Traversal
4.3 Minimum Spanning Tree (MST)
4.4 Single-Source Shortest Paths (SSSP)
4.5 All-Pairs Shortest Paths (APSP)
4.6 Special Graphs
4.7 Solution to Non-Starred Exercises
4.8 Chapter Notes
End of Book 1
Preview of Book 2
Bibliography
Index