第一次上机作业
- 玛雅历
- 棋盘问题
- Til the Cows Come Home (Dijkstra)
- 仙岛求药 (BFS)
- 二叉树的操作 (Divide and Conquer)
- 2的幂次方表示 (Divide and Conquer)
第二次上机作业
- Butterfly (Bipartite Graph)
- Dynamic Median (Priority Queue)
- Yogurt Factory (Greedy)
- The Unique MST (Minimum Spanning Tree)
- Subway (Dijkstra)
- All Discs Considered (Topological Sort)
第三次上机作业
- 求逆序对数 (Divide and Conquer)
- Raid (The Closest Pairs)
- Longest Ordered Subsequence (Longest Increasing Subsequence)
- Common Subsequence (Longest Common Subsequence)
- 月度开销 (Divide and Conquer, Binary Search)
- LITTLE SHOP OF FLOWERS (Dynamic Programming)
第四次上机作业
- Arbitrage (SPFS, Negative Cycle Detect)
- Multiplication Puzzle (Matrix Multiplication)
- Drainage Ditches (Maximum Net Flow)
- The Perfect Stall (Maximum Net Flow)
- Dual Core CPU (Maximum Net Flow)
- Dining (Maximum Net Flow)
模拟考试
- To Europe! To Europe! (Dynamic Programming)
- Radar Installation (Greedy)
- Percolation (Disjoint Set Union)
- Palindrome (Dynamic Programming)
- 重要逆序对 (Divide and Conquer)
- 昂贵的聘礼 (SPFS, Negative Cycle Detect)