AlgoAtCoderPythonAtCoder Beginner ContestCodeforcesABC模擬(Simulation)狀態壓縮計數(Counter)前綴和(Prefix Sum)貢獻法縮點有序容器(Sorted Container)LeetCodegraduate周賽二進位枚舉Floyd-Warshall枚舉(Enumeration)位運算(Bit Manipulation)Weekly Contest雜湊表(Hash Table)動態規劃(DP)打家劫舍樹狀陣列(BIT)線段樹(Segment Tree)分治法(Divide and Conquer)樹上貪心雙指標(Two Pointers)分組循環質因數分解區間合併滑動窗口(Sliding Window)組合數學(Combinatorics)乘法反元素(Inverse Element)中位數貪心最短路徑(Shortest Path)動態規劃(Dynamic Programming)每日一題DailyUVACPE貪心(Greedy)數學(Math)CPE49幾何與座標暴力法(Brute Force)二分搜尋(Binary Search)矩陣(Matrix)回溯(Backtracking)剪枝(Pruning)子集型回溯前綴異或和記憶化搜索(Memoization)字典樹(Trie)併查集(Disjoint Set)圖(Graph)DSUBFS陣列(Array)拓樸排序(Topological Sort)字串(String)排序(Sorting)堆疊(Stack)反悔貪心堆積(Heap)樹形DP狀態機DPLogTrick歸納法(Induction)雙指針(Two Pointers)差分陣列(Difference Array)計數(Counting)計數排序(Counting Sort)遞迴(Recursion)排序(Sort)最大公因數(GCD)暴力(Brute Force)腦筋急轉彎(Brain Teaser)樹(Tree)二元樹(Binary Tree)二元搜尋樹(BST)資料流(Data Stream)設計(Design)集合(Set)DFSBST鏈結串列(Linked List)佇列(Queue)有序集合(Ordered Set)單調佇列(Monotonic Queue)單調棧(Monotonic Stack)字典序(Lexicographical Order)FCFS幾何(Geometry)BitSet拓撲排序(Topological Sort)乘法原理狀態壓縮(Bitmask)狀壓DP數論(Number Theory)圖論(Graph)分類討論同餘定理Binary Tree貪婪(Greedy)基本(Basic)輾轉相除法AOAPC-BAC矛盾法(Contradiction)快速冪矩陣快速冪組合數學最小支配集(Minimum Dominating Set)進制轉換埃氏篩(Sieve of Eratosthenes)併查集(Union Find)LIS前後綴分解模運算(Modulo)C++AtCoder Beginner Contest 378模運算(Modular Arithmetic)逆序對(Inverse Pair)迭代(Iteration)博弈論(Game Theory)記憶化搜尋(Memoization)
評論
WalineGiscus
