競技程式設計(二)
Competitive Programming (II)
| 節 | 週五 |
|---|---|
A 18:30–19:20 | 競技程式設計(二) EC122（光復） 3 節連堂 |
B 19:30–20:20 | |
C 20:30–21:20 |
* 根據陽明交大上課時間表所列
This is a second 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 If you didn't pass competitive programming I, then you must pass the qualification test in week 2.
無備註
Will be lectured online: https://meet.google.com/vez-upkr-wxr Video clips will be available Register http://codeforces.com/ Register https://oj.nctu.me/ NCTU OJ Manual https://hackmd.io/s/BJMDPT4cb No plagiarism
Pass: Able to compete with descent Taiwanese teams (Top 6 of NTU teams, top 4 of NTHU teams) 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 4, written by Steven Halim, Felix Halim and Suhendry Effendy, published by LuLu Enterprises, 2020. Introduction to Algorithms: A Creative Approach by Udi Manber Handouts
- 地點
- By appointment
- 時間
- By appointment
- 聯絡方式
- mzshieh@nycu.edu.tw