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