AlgoPythonCodeforcesAtCoderAtCoder 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)LeetCodegraduateSortingDynamicProgrammingOpenAndCloseIntervalTrickDeprecatedStringHashTableBacktrackingPruningTrieMemoizationBitManipulation子集型回溯ArrayStackMonotonicStackPrefixSumContributionMethodDesignHeapDataStreamTwoPointers對頂堆112台大IntervalDP區間DPSlidingWindowEnumerationOnlineJudge前綴和優化DPMathMatrixExponentiationSortedListMergeSortDivideandConquerBinaryIndexedTreeSegmentTreeCounting二維偏序PartialOrderGreedy二進位貪心試填法MonotonicQueueConvexHullTrickDivideAndConquerDivideAndConquerDP劃分型DP斜率優化DP決策單調性優化DPDigitDPMeetInTheMiddleKnapsack01KnapsackBinarySearchOrderedContainerDisjointSet區間併查集Bitmask二進制枚舉KnapsackDPDifferenceArrayGraphTheory等價轉化位元運算(Bitmasks)動態規劃(DynamicProgramming)數學(Math)互動題(Interactive)構造(Constructive Algorithms)排序(Sorting)機率(Probabilities)期望(Expectation)根號分治(SquareRootDecomposition)字串(Strings)實作(Implementation)枚舉(Enumeration)前綴和(PrefixSum)特殊方法(Ad Hoc)分治(DivideAndConquer)樹(Trees)組合數學(Combinatorics)數論(Number Theory)位運算(Bitmask)二分圖(Bipartite Graph)Run-Twice通信題(Communication Problem)曼哈頓距離(Manhattan Distance)差分陣列(Difference Array)Biweekly Contest陣列(Array)構造(Construction)周賽二進位枚舉Floyd-Warshall樹上貪心Weekly Contest動態規劃(DP)打家劫舍分治法(Divide and Conquer)記憶化搜索(Memoization)圖論(Graph Theory)等價轉化(Equivalence Transformation)滑動窗口(Sliding Window)分類討論(Case Analysis)質因數分解乘法反元素(Inverse Element)區間合併中位數貪心最短路徑(Shortest Path)每日一題Daily計數排序(Counting Sort)堆疊(Stack)圖(Graph)暴力法(Brute Force)最大公因數(GCD)暴力(Brute Force)堆積(Heap)矩陣(Matrix)模運算(Modulo)腦筋急轉彎(Brain Teaser)集合(Set)二元樹(Binary Tree)二元搜尋樹(BST)資料流(Data Stream)設計(Design)剪枝(Pruning)前綴異或和DSULIS前後綴分解113交大圖論(Graph)拓樸排序(Topological Sort)基環樹(Pseudotree)反悔貪心樹形DP狀態機DPLogTrick歸納法(Induction)併查集(Union Find)BST迭代器(Iterator)106中央鏈結串列(Linked List)有序集合(Ordered Set)單調佇列(Monotonic Queue)單調棧(Monotonic Stack)字典序(Lexicographical Order)FCFSBitSet拓撲排序(Topological Sort)乘法原理字典樹(Trie)狀態壓縮(Bitmask)分類討論同餘定理主定理(Master Theorem)107中央113中興Binary TreeLuogu背包問題(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)二分答案BitmaskDP數位DP同向雙指標PrefixMaxSparseTableGeometryLazySegmentTree二維LIS破環成鏈SimulationTreeTreeDiameter樹的直徑DataStructuresIntervalIntersectionGraphUnionFindReverseGraphReachabilityCoordinateCompressionIntervalUnionRMQConstructiveShortestPathTrickPermutationPermutationCycleCyclicPermutationConnectedComponent置換環FenwickTreeCombinatoricsKnapsackProblemManhattanDistanceChebyshevDistance座標轉換StateMachineDPBinaryLiftingMEXComputationalGeometryContributionTechniqueSuffixMinModularInversePermutationDP排列DPLDSDilworthTheoremPartiallyOrderedSetRepentanceGreedyFloydWarshallInversionCount逆序對樹狀陣列LinearDPHouseRobberCoordinateTransform二維前綴和曼哈頓距離轉切比雪夫距離不定長滑動窗口滑動窗口最大值OfflineQueryHeuristicMergeDisjointSetUnion啟發式合併ConstructiveAlgorithmsWeightedDisjointSetBruteForceRecursionGameTheoryRerootingDPInteractiveNumberTheorymultisetPigeonholePrincipleDfsAndSimilarDFN二維後綴和AdHoc刷表法PathCompressionTreapFHQTreapCSP-JCountingSortPrefixXorExcusiveOr正難則反單調佇列優化DPExclusiveORWeightedDSU帶權並查集SqrtDecomposition根號分治QueuePrefixMinHashingRandomizedPseudoTree和雜湊貪婪(Greedy)基本(Basic)輾轉相除法AOAPC-BAC矛盾法(Contradiction)進制轉換快速冪組合數學最小支配集(Minimum Dominating Set)埃氏篩(Sieve of Eratosthenes)
評論
WalineGiscus
