| 1 |
09/15 |
Introduction* |
|
Introduction to Competitive Programming
Before-class Contest
|
| 2 |
09/22 |
C++ |
|
Standard Library, STL especially
Common Usage
|
| 3 |
09/29 |
Way of Thinking |
|
Enumeration
Divide and Conquer
Dynamic Programming
Greedy Algorithm
|
| 4 |
10/06 |
Search* |
|
Binary Search
Ternary Search
Contest Range: Week 1~3
|
| 5 |
10/13 |
Sorting & Basics of Graph |
|
Quick Sort
Merge Sort
Graph
Tree
|
| 6 |
10/20 |
Contest* |
|
Contest Range: Week 4~5
|
| 7 |
10/27 |
Dynamic Programming |
|
Dynamic Programming
Greedy Algorithm
|
| 8 |
11/03 |
Range Query* |
|
Segment Tree & Sparse Table
Contest Range: Week 7
|
| 9 |
11/10 |
Contest* |
|
Contest Range: Week 7~8
|
| 10 |
11/17 |
Buffet Contest* |
|
Contest Range: Week 1~9
|
| 11 |
11/24 |
Graph |
|
Single-Source Shortest Paths
All-Pairs Shortest Paths
Minimum Spanning Tree
|
| 12 |
12/01 |
Graph |
|
Articulation Point
Bridge
Biconnected Component
Strongly Connected Components
Lowest Common Ancestor
|
| 13 |
12/08 |
Contest* |
|
Contest Range: Week 11~12
|
| 14 |
12/15 |
Number theory |
|
Greatest Common Divisor
Exponentiation by squaring
Prime
Modulus
|
| 15 |
12/22 |
Number theory & Calculation |
|
Karatsuba
Floating point precision
Computational geometry
|
| 16 |
12/29 |
Contest* |
|
Contest Range: Week 14~15
|
| 17 |
01/05 |
Flow & Matching & Cover |
|
Matching
Cover & Independent Set
Network Flow
Min-cut
|
| 18 |
01/12 |
Buffet Contest* |
|
Contest Range: Week 1~17
|
