---
title: 孩子們20202的北市賽菜單
tags: 菜單
---
# 文元的愉悅菜單

***斜體*代表比較不重要**
## C++ Syntax
- [ ] Operator Overload
- [ ] Struct & Class
- [ ] Function
- [ ] *Functor (Function Object)*
## Std Lib
### STL
- [ ] vector
- [ ] set
- [ ] map
- [ ] *unordered_set / unordered_map*
- [ ] list
- [ ] priority_queue
- [ ] deque
### Utils
- [ ] pair
- [ ] tuple
- [ ] string
### \<algorithm\>
- [ ] sort
- [ ] max / min
## Topics of Competitive Programming
### 設計手法
- [ ] DP
- [ ] Divide & conquer
- [ ] Greedy
- [ ] Recursion
### Algorithm
#### Graph (Sorted)
- [ ] Shortest Path
- [ ] Minimal Spanning Tree (MST)
- [ ] *Sub-Minimal Spanning Tree (SBMST)*
#### Geometry (Sorted)
- [ ] 數學向量基礎
- [ ] 有向面積
- [ ] *Convex Hull*
### Data Structure (Sorted)
- [ ] Array
- [ ] Linked List
- [ ] Disjoint Set
- [ ] Adjacent Matrix / Adjacent List
- [ ] Binary Tree
- [ ] Binary Search Tree
- [ ] *Self-Balanced Binary Tree(Treap etc.)*

# 戴惟的電力菜單
## Beginner

### Searching
- [x] DFS
- [x] BFS
- [x] Binary Searching
- [ ] Every kind of sorting
- [ ] Segment Tree
- [ ] Fenwick Tree

### Dynamic Programming

- [x] What is state? What is transform formula?
- [x] LIS $O(n\ log\ n)$
- [x] LCS $O(n^2)$
- [x] Backpack
- [ ] Floyd Warshell

### Graph

- [x] How to store graph?
- [x] Tree, loop, DAG
- [x] Binary Tree && BST
- [x] Disjoint Set
- [x] Dijkstra
- [ ] Kruscal
- [x] Convex Hull

## Intermediate

### Search

- [ ] Segment tree
- [ ] N-Dimension Fenwick tree
- [ ] A-star - Feel the linear distance

### Dynamic Programming

- [ ] Multiple Backpack
- [ ] Convex Hull optimization
- [ ] Alien Optimization

### Graph

- [ ] Bellmen Ford
- [ ] LCA & Applications
- [ ] Articulation Point
- [ ] What is FCC & SCC ?
- [ ] Tarjan
- [ ] Kosaraju’s

## Expert
Go to codeforces and compete, there's nothing I can teach.
去[CF](https://codeforces.com/)打比賽吧，戴惟要膜拜你了\(?

# 演算法好朋友
- [演算法筆記](http://web.ntnu.edu.tw/~algo/)
- [日月掛長模板庫](http://sunmoon-template.blogspot.com/)
- [GeeksForGeeks](https://www.geeksforgeeks.org/)
- [CodeChef](https://www.codechef.com/)