競技程式設計(二)
Competitive Programming (II)
| 節 | 週五 |
|---|---|
A 18:30–19:20 | 競技程式設計(二) ED117（光復） 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
This is an introductory course in competitive programming. It will cover topics in Graph theory, Computational Geometry, Advanced Data Structures, String Processing, Number theory, Combinatorics and so on.
Competitive Programming I
無備註
請註冊 http://codeforces.com/ 請註冊 https://oj.nctu.me/ 使用說明 https://hackmd.io/s/BJMDPT4cb 作業禁止抄襲、作業 Deadline 為 +3週的週六午夜。
Pass: Able to compete with the 3rd team from NTHU or able to convince the lecturer that you can pass Fail: Otherwise
教師未提供此項資料
| 週次 | 主題 |
|---|---|
| 第 1 週 | Orientation |
| 第 2 週 | Graph theory: Traversal |
| 第 3 週 | Graph theory: Connected Component and Spanning Trees |
| 第 4 週 | Graph theory: Shortest paths |
| 第 5 週 | Graphy theory: Flow networks |
| 第 6 週 | Advanced Data Structures: Balanced BST |
| 第 7 週 | Advanced Data Structures: Augmentation |
| 第 8 週 | Computational Geometry |
| 第 9 週 | Practice Contest 1 |
| 第 10 週 | String Processing: AC automaton, Z-algorithm |
| 第 11 週 | Practice Contest 2 |
| 第 12 週 | String Processing: Suffix Arrays |
| 第 13 週 | Number Theory |
| 第 14 週 | Practice Contest 3 |
| 第 15 週 | Combinatorics |
| 第 16 週 | Linear Programming |
| 第 17 週 | Selected Topics |
| 第 18 週 | Final |
Competitive Programming 3, written by Steven Halim and Felix Halim, published by LuLu Enterprises, 2013. Introduction to Algorithms: A Creative Approach by Udi Manber Handouts
- 地點
- CS337
- 時間
- By appointment
- 聯絡方式
- mzshieh@nctu.edu.tw