# 程式競賽 - [Intro](https://hackmd.io/@speedcubing/cp-intro) - [Code Technique](https://hackmd.io/@speedcubing/cp-codetechique) - [Struct](https://hackmd.io/@speedcubing/cp-struct) - [STL Container](https://hackmd.io/@speedcubing/cp-stl) - [IO](https://hackmd.io/@speedcubing/cp-io) - [Utils](https://hackmd.io/@speedcubing/cp-utils) # 演算法 ## 目錄 - [目錄](https://hackmd.io/@speedcubing/cp-alg-overview) ## 資料結構 - [Disjoint Set](https://hackmd.io/@speedcubing/cp-alg-disjoint-set) ## 動態規劃-經典問題 - [Maximum Continuous Subarray](https://hackmd.io/@speedcubing/cp-alg-dp-maximum-continuous-subarray) - [String Edit Distance (Levenshtein Distance)](https://hackmd.io/@speedcubing/cp-alg-dp-string-edit-distance) - [Longest Increasing Subsequence (LIS)](https://hackmd.io/@speedcubing/cp-alg-dp-lis) - [Longest Common Subsequence (LCS)](https://hackmd.io/@speedcubing/cp-alg-dp-lcs) - [Assembly Line Scheduling](https://hackmd.io/@speedcubing/cp-alg-assembly-line-scheduling) - [Matrix Chain Multiplication](https://hackmd.io/@speedcubing/cp-alg-dp-matrix-chain-multiplication) ## 圖論 - [BFS](https://hackmd.io/@speedcubing/cp-alg-bfs) - [DFS](https://hackmd.io/@speedcubing/cp-alg-dfs) - [MST](https://hackmd.io/@speedcubing/cp-alg-mst) - [Shortest Path](https://hackmd.io/@speedcubing/cp-alg-shortest-path) - [Topological Sorting](https://hackmd.io/@speedcubing/cp-alg-topo) - [SCC Algorithms](https://hackmd.io/@speedcubing/cp-alg-scc) ## 問題 - [背包問題](https://hackmd.io/@speedcubing/cp-alg-knapsack-problem) ## 未分類 - [質數表](https://hackmd.io/@speedcubing/cp-alg-primes) - [Greedy](https://hackmd.io/@speedcubing/cp-alg-greedy)
{"title":"程式競賽","description":"-須知","contributors":"[{\"id\":\"bd691137-ce16-4810-8bd3-9bdda14becb3\",\"add\":2390,\"del\":563,\"latestUpdatedAt\":1766225412723}]"}
Expand menu