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)CodeforcesLeetCodegraduate每日一題Weekly Contest動態規劃(DP)打家劫舍分治法(Divide and Conquer)周賽質因數分解滑動窗口(Sliding Window)組合數學(Combinatorics)乘法反元素(Inverse Element)區間合併中位數貪心最短路徑(Shortest Path)Floyd-Warshall二進位枚舉枚舉(Enumeration)樹上貪心Daily排序(Sorting)計數排序(Counting Sort)數學(Math)陣列(Array)堆疊(Stack)圖(Graph)暴力法(Brute Force)排序(Sort)最大公因數(GCD)暴力(Brute Force)堆積(Heap)矩陣(Matrix)模運算(Modulo)雙指針(Two Pointers)腦筋急轉彎(Brain Teaser)集合(Set)二元樹(Binary Tree)二元搜尋樹(BST)資料流(Data Stream)設計(Design)剪枝(Pruning)子集型回溯字典樹(Trie)前綴異或和DSULIS前後綴分解113交大圖論(Graph)拓樸排序(Topological Sort)基環樹(Pseudotree)反悔貪心112台大樹形DP狀態機DPLogTrick歸納法(Induction)併查集(Union Find)差分陣列(Difference Array)BST迭代器(Iterator)106中央鏈結串列(Linked List)有序集合(Ordered Set)單調佇列(Monotonic Queue)單調棧(Monotonic Stack)字典序(Lexicographical Order)FCFSBitSet拓撲排序(Topological Sort)乘法原理狀態壓縮(Bitmask)數論(Number Theory)分類討論同餘定理主定理(Master Theorem)107中央113中興Binary TreeUVACPECPE49幾何與座標貪婪(Greedy)基本(Basic)輾轉相除法AOAPC-BAC矛盾法(Contradiction)進制轉換快速冪組合數學最小支配集(Minimum Dominating Set)埃氏篩(Sieve of Eratosthenes)
評論
WalineGiscus
