| 1 |
03/04 |
Introduction* |
|
成績計算
競技程式設計介紹
學期課程規劃
Beforehand Contest
|
| 2 |
03/11 |
I/O & Standard Template Library |
|
I/O
Basic programming
Introduction
STL: vector, string, queue, stack, list, set, map, priority_queue, functions
|
| 3 |
03/18 |
Thought method |
|
Divide and Conquer
Enumeration
Dynamic Programming
Merge Sort
Fibonacci Sequence
Longest Increasing Subsequence
|
| 4 |
03/25 |
Search* |
|
Binary Search
std::lower_bound, std::upper_bound
|
| 5 |
04/01 |
Sorting & Graph Structures |
|
Counting Sort
Discretization
Tree
Graph
DFS, BFS
Disjoint Sets
|
| 6 |
04/08 |
Contest* |
|
|
| 7 |
04/15 |
Dynamic Programming |
|
Longest Common Subsequence
Knapsack problem
Greedy
|
| 8 |
04/22 |
DP Contest* |
|
Dynamic Programming
|
| 9 |
04/29 |
Data Structures |
|
Segment Tree
Binary Indexed Tree
Differences
|
| 10 |
05/06 |
Buffet Contest* |
|
Buffet
|
| 11 |
05/13 |
Graph |
|
Single-Source Shortest Paths
All-Pairs Shortest Paths
Minimum Spanning Tree
A* search
|
| 12 |
05/20 |
Graph |
|
Articulation point
Strongly Connected Components
Lowest Common Ancestor
|
| 13 |
05/27 |
Matching & Flow |
|
Bipartite Graph Matching
Flow
|
| 14 |
06/03 |
Number theory* |
|
Modulus
Greatest Common Divisor
|
| 15 |
06/10 |
Number theory & Calculation |
|
Prime
Floating point precision
Karatsuba
Fast Exponential
|
| 16 |
06/17 |
Contest* |
|
|
| 17 |
06/24 |
Buffet Contest* |
|
Buffet
|
