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

فهرست مطالب :

Contents
Authors\' Profiles
Steven Halim, PhD 1
Felix Halim, PhD 2
Suhendry Effendy, PhD 3
Mathematics
5.1 Overview and Motivation
5.2 Ad Hoc Mathematical Problems
5.3 Number Theory
5.4 Combinatorics
5.5 Probability Theory
5.6 Cycle-Finding
5.7 Game Theory (Basic)
5.8 Matrix Power
5.9 Solution to Non-Starred Exercises
5.10 Chapter Notes
String Processing
6.1 Overview and Motivation
6.2 Ad Hoc String (Harder)
6.3 String Processing with DP
6.4 String Matching
6.5 Suffix Trie/Tree/Array
Profile of Data Structure Inventors
6.6 String Matching with Hashing
6.7 Anagram and Palindrome
6.8 Solution to Non-Starred Exercises
6.9 Chapter Notes
(Computational) Geometry
7.1 Overview and Motivation
7.2 Basic Geometry Objects with Libraries
7.3 Algorithms on Polygon with Libraries
7.4 3D Geometry
7.5 Solution to Non-Starred Exercises
7.6 Chapter Notes
More Advanced Topics
8.1 Overview and Motivation
8.2 More Advanced Search Techniques
8.3 More Advanced DP Techniques
8.4 Network Flow
8.5 Graph Matching
8.6 NP-hard/complete Problems
8.7 Problem Decomposition
8.8 Solution to Non-Starred Exercises
8.9 Chapter Notes
Rare Topics
9.1 Overview and Motivation
9.2 Sliding Window
9.3 Sparse Table Data Structure
9.4 Square Root Decomposition
9.5 Heavy-Light Decomposition
9.6 Tower of Hanoi
9.7 Matrix Chain Multiplication
9.8 Lowest Common Ancestor
9.9 Tree Isomorphism
9.10 De Bruijn Sequence
9.11 Fast Fourier Transform
9.12 Pollard’s rho Algorithm
9.13 Chinese Remainder Theorem
9.14 Lucas’ Theorem
9.15 Rare Formulas or Theorems
9.16 Combinatorial Game Theory
9.17 Gaussian Elimination Algorithm
9.18 Art Gallery Problem
9.19 Closest Pair Problem
9.20 A* and IDA*: Informed Search
9.21 Pancake Sorting
9.22 Egg Dropping Puzzle
9.23 Dynamic Programming Optimization
9.24 Push-Relabel Algorithm
9.25 Min Cost (Max) Flow
9.26 Hopcroft-Karp Algorithm
9.27 Kuhn-Munkres Algorithm
9.28 Edmonds’ Matching Algorithm
9.29 Chinese Postman Problem
9.30 Constructive Problem
9.31 Interactive Problem
9.32 Linear Programming
9.33 Gradient Descent
9.34 Chapter Notes
Bibliography
Index