CodeBook

Competitive Programming Algorithm Notes.

Outline

1. Basic

   1.1 Syntax

   1.2 Linux Command

   1.3 Substring

   1.4 BigIneger(java)

   1.5 Big Number(cpp)

2. Data Structure

   2.1 Tree

   2.2 Disjoint Set

   2.3 Segment Tree

   2.4 Tree Policy

   2.5 KMP

   2.6 LCA

   2.7 Heap

3. Divide and Conquer

   3.1 Maximum SubArray

   3.2 Closet Set Pair

   3.3 Merge Sort

4. Dynamic Programming

   4.1 LCS

   4.2 LIS

   4.3 Knapsack

   4.4 Change Coin

   4.5 String Edition

   4.6 Chain Matrix Multiply

5. Search

   5.1 Binary Search

6. Sequence

   6.1 RSQ(Prefix Sum)

   6.2 RSQ(2DPrefix Sum)

   6.3 RSQ(Fenwick Tree)

7. Sorting

   7.1 Counting Sort

   7.2 Topology Sort

   7.3 Topology Sort with DFS(check no cycle)

8. Graph

   8.1 DFS

   8.2 DFS with Discover and Finish time

   8.3 DFS Tree

   8.4 BFS

   8.5 AOE

   8.6 Dijkstra

   8.7 SPFA

   8.8 BellmanFord

   8.9 FloydWarshall

   8.10 Kruskal

   8.11 Articulation Point

   8.12 KM

   8.13 Bipartite Matching

   8.14 Check Bipartite

   8.15 CLE Directed MST

   8.16 Dinic

   8.17 MCMF

   8.18 DP + Dijkstra

   8.19 MST + Enumeration

9. Number

   9.1 Sieve

   9.2 Power

   9.3 Euler

   9.4 Factors

   9.5 Extend Euclidean

   9.6 Matrix

   9.7 GaussElimination

10. Geometry

    10.1 Geometry

    10.2 Lines Intersection1

    10.3 Lines Intersection2

    10.4 Polygon Inside Or Outside

    10.5 Convex Hull

codebook.pdf