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