2024 Introduction to Competitive Programming
2024 / 2 / 21
Course Administration
course link
Lab location
Coach
- William Hsu (Discord: wwyhsu#1083)
Co-Coach
Lecturer
- 李欣祐 (Discord: LeeShoW)
- 胡智涵 (Discord: zihan8130)
TA hour
406, 407 in ECG 809
Competitive Programming 4
作者: Steven Halim, Felix Halim, Suhendry Effendy

算法競賽入門經典(第2版)
作者: 劉汝佳

Competitive Programming
- Given well-known computer science problems, solve
them as fast as possible
- Using Data Structure and Algorithm Solving them
- Teamwork
Prerequisite knowledge
- Time Complexity
- Brute Force Algorithm
- Dynamic Programming
- Greedy
- Binary Search
- BFS/DFS
- Divide and Conquer
- Segment Tree (RMQ)
Winter Camp Course
Course
-
Tree
- Lowest Common Ancestor
- DSU on Tree
- Heavy-Light Decomposition
-
Graph
- Shortest Path
- Topological Sort
- SCC/BCC
- 2-SAT
- Eulerian Path
-
Geometry
- Inner, Outer Product
- Line Intersection
- Convex hull construction
- Sweep Line
- Math
- Modulo Operation
- Modular Multiplicative Inverse
- Prime
- Gaussian Elimination
- Dynamic Programming
- DP on DAG
- Stack / Deque
- Bitmask DP
- 1D/1D Dynamic Programming
- DP on Tree
- Digit DP
- Data Structure
- Sparse Table
- Treap
- Persistent Data Structure
- String
Scoring
Basic (90%)
- Homework 20%
- Mock Contest 18%
- Midterm Exam 26%
- Final Exam 26%
2024 Introduction to Competitive Programming 2024 / 2 / 21
{"slideOptions":"{\"transition\":\"fade\"}","description":"–type: slide","contributors":"[{\"id\":\"19f09ccf-6b99-452f-971f-955cfc1657f3\",\"add\":3638,\"del\":280},{\"id\":\"08326fa4-ca9b-4ca9-873e-239ebe76662c\",\"add\":318,\"del\":384},{\"id\":\"c09566ae-e372-4be1-b467-1ebdd3589721\",\"add\":3359,\"del\":3292}]","title":"2024 Introduction to Competitive Programming"}