AlgoAtCoderPythonAtCoder Beginner ContestABC模擬(Simulation)狀態壓縮計數(Counter)前綴和(Prefix Sum)貢獻法縮點有序容器(Sorted Container)C++模運算(Modular Arithmetic)雜湊表(Hash Table)回溯(Backtracking)DFSBFS樹狀陣列(BIT)逆序對(Inverse Pair)樹(Tree)計數(Counting)分組循環迭代(Iteration)遞迴(Recursion)字串(String)併查集(Disjoint Set)博弈論(Game Theory)動態規劃(Dynamic Programming)記憶化搜尋(Memoization)狀壓DP雙指標(Two Pointers)枚舉右維護左差分陣列(Difference Arrays)二分搜尋(Binary Search)貪心(Greedy)矩陣快速冪位運算(Bit Manipulation)佇列(Queue)幾何(Geometry)線段樹(Segment Tree)懶標記線段樹(Lazy Segment Tree)CodeforcesAtCoder Weekday ContestAWC差分陣列(Difference Array)狀態壓縮DP(Bitmask DP)最短路(Shortest Path)Floyd-WarshallTSP圖論(Graph)反向圖(Reverse Graph)可達性(Reachability)離散化(Coordinate Compression)區間覆蓋(Interval Coverage)分治(Divide and Conquer)稀疏表(Sparse Table)RMQABC436排列(Permutation)置換環(CycleDecomposition)連通分量(ConnectedComponents)樹狀陣列(FenwickTree)BIT組合數學(Combinatorics)數位DP(DigitDP)背包問題(KnapsackProblem)數學(Math)ABC437前綴和(PrefixSum)排序(Sorting)字典樹(Trie)圖(Graph)深度優先搜索(DFS)反悔貪心線段樹(SegmentTree)曼哈頓距離(ManhattanDistance)座標變換(CoordinateTransformation)LeetCodegraduate構造(Constructive Algorithms)構造(Constructive)互動題(Interactive)數論(Number Theory)乘法反元素(Modular Multiplicative Inverse)博弈(Game Theory)樹(Trees)動態規劃(DP)換根 DP(Rerooting DP)位元運算(Bitmasks)動態規劃(DynamicProgramming)機率(Probabilities)期望(Expectation)根號分治(SquareRootDecomposition)二分搜尋(BinarySearch)位運算(Bitmask)二分圖(Bipartite Graph)Run-Twice通信題(Communication Problem)曼哈頓距離(Manhattan Distance)字串(Strings)實作(Implementation)枚舉(Enumeration)特殊方法(Ad Hoc)分治(DivideAndConquer)MEX構造(Construction Algorithm)鴿籠原理(Pigeonhole Principle)廣度優先搜尋(BFS)圖論(Graph Theory)Depth First Search (DFS)Depth First Number (DFN)二維後綴和(Two-Dimensional Suffix Sum)DP互動(Interactive)Ad HocBiweekly Contest陣列(Array)構造(Construction)樹狀陣列(Binary Indexed Tree)周賽二進位枚舉樹上貪心Weekly Contest記憶化搜索(Memoization)等價轉化(Equivalence Transformation)試填法滑動窗口(Sliding Window)打家劫舍分治法(Divide and Conquer)分類討論(Case Analysis)質因數分解乘法反元素(Inverse Element)區間合併中位數貪心最短路徑(Shortest Path)計數排序(Counting Sort)堆疊(Stack)暴力法(Brute Force)排序(Sort)最大公因數(GCD)暴力(Brute Force)堆積(Heap)矩陣(Matrix)模運算(Modulo)雙指針(Two Pointers)腦筋急轉彎(Brain Teaser)集合(Set)二元樹(Binary Tree)二元搜尋樹(BST)資料流(Data Stream)設計(Design)每日一題DailyBST迭代器(Iterator)106中央鏈結串列(Linked List)有序集合(Ordered Set)單調佇列(Monotonic Queue)單調棧(Monotonic Stack)字典序(Lexicographical Order)FCFSBitSet拓撲排序(Topological Sort)剪枝(Pruning)子集型回溯乘法原理狀態壓縮(Bitmask)DSU前後綴分解分類討論同餘定理主定理(Master Theorem)107中央113中興Binary TreeUVACPECPE49幾何與座標位運算(Bitwise Operation)Luogu單調佇列(Monotone Queue)單調佇列優化DP併查集(Disjoint Set Union)區間併查集前綴異或和LIS113交大拓樸排序(Topological Sort)基環樹(Pseudotree)112台大樹形DP狀態機DP歸納法(Induction)LogTrick併查集(Union Find)基本(Basic)AOAPC-BAC矛盾法(Contradiction)輾轉相除法進制轉換貪婪(Greedy)快速冪組合數學最小支配集(Minimum Dominating Set)埃氏篩(Sieve of Eratosthenes)
評論
WalineGiscus
