| 1 |
02/20 |
Introduction |
|
Chia-Heng Tu Talk Show
成績計算
競技程式設計介紹
學期課程規劃
|
| 2 |
02/27 |
Data Structures and Thought method |
|
IO, Basic programming
STL: vector, string, sort
Complexity analysis
Thought methods
|
| 3 |
03/06 |
Data Structures |
|
STL: queue, stack, list
|
| 4 |
03/13 |
Data Structures & Searching |
|
STL: set, map, priority_queue
Tree
Graph
Disjoint sets
DFS, BFS
|
| 5 |
03/20 |
Searching |
|
Binary search
lower_bound, upper_bound
|
| 6 |
03/27 |
Sorting |
|
Merge sort
Counting sort
|
| 7 |
04/03 |
Holiday (self training) |
|
Bonus * 1.5
|
| 8 |
04/10 |
Buffet contest |
|
Buffet
|
| 9 |
04/17 |
Dynamic Programming |
|
Fibonacci sequence
Knapsack problem
greedy method
LIS
LCS
|
| 10 |
04/24 |
DP contest |
|
Dynamic Programming
|
| 11 |
05/01 |
Graph |
|
Minimum Spanning Tree
A* search
Single-Source Shortest Paths
All-Pairs Shortest Paths
|
| 12 |
05/08 |
Graph contest |
|
Graph
|
| 13 |
05/15 |
Graph |
|
Articulation point
Strongly Connected Components
Maximum flow
|
| 14 |
05/22 |
Number theory |
|
Modulus
Greatest Common Divisor
|
| 15 |
05/29 |
Number theory & Calculation |
|
Prime
Float FUCK
Karatsuba
Fast Exponential
|
| 16 |
06/05 |
ITSA & PTC |
|
|
| 17 |
06/12 |
Contest & Contest & Contest |
|
|
| 18 |
06/19 |
Contest & Contest & Contest |
|
Buffet
|
