做个算法分类,这样找特定算法的题目就方便多了23333
竞赛工具
【竞赛工具】——sublime text4 xcpc竞赛向配置教程
算法讲解
[算法学习]——通过RMQ与dfs序实现O(1)求LCA(含封装板子)
其他算法
trick
Codeforces 1616 D. Keep the Average High (连续子段的小trick)
Codeforces Round 915 (Div. 2) D. Cyclic MEX (MEX的小trick)
为美好的xcpc献上典题——CFdiv3 498 F. Xor-Paths(折半搜索)
为美好的XCPC献上典题 [ABC351E] Jump Distance Sum (切比雪夫距离与曼哈顿距离的相互转换)
为美好的XCPC献上典题——Codeforces Round 703 (Div. 2)- Range Sort Query(求中位数/k-th数的一种思路)
为美好的XCPC献上典题——AtCoder Beginner Contest 272 G - Yet Another mod M(随机化)
为美好的XCPC献上典题——Ozon Tech Challenge 2020 (Div.1 + Div.2) F. Kuroni and the Punishment(随机化)
AtCoder Beginner Contest 242 G - Range Pairing Query (莫队)
二分
Codeforces Round 1022 (Div. 2) D. Needle in a Numstack(二分)
Educational Codeforces Round 125 D. For Gamers. By Gamers.(二分)
Codeforces Round 890 (Div. 2) C. To Become Max (二分)
Codeforces Round 813 (Div. 2) D. Empty Graph(二分)
Codeforces Round 890 (Div. 2) C. To Become Max (二分)
Codeforces Round 813 (Div. 2) D. Empty Graph(二分)
根号分治
为美好的XCPC献上典题 ABC359 G - Sum of Tree Distance(根号分治)
为美好的XCPC献上典题——CF920 F. Sum of Progression(根号分治)
为美好的XCPC献上典题——E. Array Queries(根号分治)
枚举
Codeforces Round 717 (Div. 2) D. Cut (倍增)
E2. Divisible Numbers (hard version) (枚举)
Educational Codeforces Round 66 D. Array Splitting (前缀和)
Educational Codeforces Round 119 D. Exact Change(枚举)
Educational Codeforces Round 55 E. Increasing Frequency(贪心)
Educational Codeforces Round 76 D(双指针)
每日一题——Tokitsukaze and Strange Inequality(codeforces)(枚举)
每日一题——Progressions Covering(codeforces)(贪心)
构造
Codeforces Round 638 (Div. 2) D. Phoenix and Science(构造)
Codeforces Round #822 (Div. 2) E. Rectangular Congruence(构造)
思维
牛客练习赛118 C. Future Machine(思维)
AtCoder Beginner Contest 319 E - Bus Stops (思维)
Codeforces Round 641 (Div. 1) B. Orac and Medians(思维)
哈希
B. Non-Palindromic Substring(字符串哈希)
为美好的XCPC献上典题——EDU95 G. Three Occurrences(异或哈希)
数据结构
st表
为美好的XCPC献上典题——Codeforces Global Round 21 D. Permutation Graph(st表+分治)
Educational Codeforces Round 28 C,D(st表)
tree
AtCoder Beginner Contest 281 F - Xor Minimization (字典树)
为美好的XCPC献上典题——CF381 div1 B. Alyona and a tree(倍增+树上差分)
为美好的XCPC献上典题——EDU162 E. Count Paths(启发式合并)
Educational Codeforces Round 132 E. XOR Tree (启发式合并)
Codeforces Round 907 (Div. 2) F. A Growing Tree(树链剖分+树上前缀和)
Codeforces Round 888 (Div. 3) G. Vlad and the Mountains(LCA)
Codeforces Round 881 F2. Omsk Metro (hard version) (树链剖分)
Codeforces Round 805 G2. Passable Paths (hard version) (LCA)
Codeforces Round 646 (Div. 2) E. Tree Shuffling(启发式合并)
Manthan, Codefest 19 (open for everyone, rated, Div. 1 + Div. 2) D(树状数组+二分)
线段树
Educational Codeforces Round 67 D. Subarray Sorting(思维+线段树)
为美好的XCPC献上典题——AtCoder Beginner Contest 237 G - Range Sort Query(线段树)
为美好的XCPC献上典题——C. Cloud Computing(扫描线+权值线段树)
为美好的XCPC献上典题——F. SUM and REPLACE(势能线段树+积性函数)
数论分块
Codeforces Round 846 (Div. 2) E(数论分块)
其他
EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2) E(单调栈)
为美好的XCPC献上典题——Educational Codeforces Round 41 E(数据结构)
2023河南萌新联赛第(六)场 F 爱睡大觉的小C (链表)
为美好的XCPC献上典题——D2. 388535 (01Tire)
每日一题——Program(codeforces)(数据结构)
数学
Educational Codeforces Round 177 (Rated for Div. 2) D(组合数)
为美好的XCPC线上典题——EDU89 D. Two Divisors(数论)
Codeforces Round 925 (Div. 3) F(拓扑排序)G(组合数学)
XCPC训练时在做什么?有没有空?可以来做math吗?(三)
每日一题——Codeforces Round 752 (Div. 2)D. Moderate Modular Mode(math)
XCPC训练时在做什么?有没有空?可以来做math吗?(一)
Daimayuan每日一题——Ayoub’s function(数学)
每日一题——Lonely Numbers(codeforces)(数学)
每日一题——Maximum splitting(codeforces)(数学)
每日一题——The Meaningless Game(codeforces)(数学)
Codeforces Round #847 (Div. 3) E(数学)
每日一题——Almost Difference(codeforces)(数学)
图论
Codeforces Round 1021 (Div. 2) D. Baggage Claim(建图)
AtCoder Beginner Contest 243 E - Edge Deletion(Floyd)
为美好的XCPC献上典题——CF597 D. Shichikuji and Power Grid(最小生成树)
为美好的XCPC献上典题——CF580 B. Shortest Cycle(最小环+思维)
为美好的XCPC献上典题——CFdiv1+2 621 D. Cow and Fields(最短路)
Codeforces Round 923 (Div. 3) F. Microcycle(割边)
2023山东省赛J. Not Another Path Query Problem(枚举+并查集)
Codeforces Round 101 (Div. 2) E(思维+图论)
为美好的XCPC献上典题——Educational Codeforces Round 54 E(树上差分)
为美好的XCPC献上典题——Codeforces Round 359 (Div. 1) B(树的重心)
AtCoder Beginner Contest 302 F(01BFS)
每日一题——Cactus Wall(codeforces)(图论)
每日一题——Cheap Dinner(codeforces)(dp?最短路)
Daimayuan每日一题——Minimum Or Spanning Tree(图论)
动态规划
为美好的XCPC献上典题——ABC310 F - Make 10 Again (状压概率dp)
为美好的XCPC献上典题——CF683div1 C. Xor Tree(字典树dp)
Educational Codeforces Round 167 (Rated for Div. 2) D(记忆化)
为美好的XCPC献上典题 CF829Div1 C. Wish I Knew How to Sort (期望dp)
为美好的XCPC献上典题——CF899 D. Tree XOR (换根DP)
为美好的XCPC献上典题——EDU161 F. Replace on Segment(区间dp)
Codeforces Round 916 (Div. 3) F. Programming Competition(树形dp)
Educational Codeforces Round 50 C(数位DP)
AtCoder Beginner Contest 215 E(dp) F(二分)
为美好的XCPC献上典题——Educational Codeforces Round 58 D (DP)
Educational Codeforces Round 63 D(dp)
Codeforces Round #723 (Div. 2) B. I Hate 1111
竞赛题解
codeforces
EDU
Educational Codeforces Round 176 (Rated for Div. 2) C,D
Educational Codeforces Round 172 (A-D)
Educational Codeforces Round 158 (Rated for Div. 2)(A-D)
Educational Codeforces Round 157 (Rated for Div. 2) (A-D)
Educational Codeforces Round 33 (A-E)
Educational Codeforces Round 10
Educational Codeforces Round 25(A-G)
Educational Codeforces Round 42 (Rated for Div. 2)(A-F)
Educational Codeforces Round 32(C-E)
Educational Codeforces Round 142 C(双指针/dp) D(tire树)
Educational Codeforces Round 159 D(思维+二分) E(字典树)
Educational Codeforces Round 7(C-E)
Educational Codeforces Round 141 (Rated for Div. 2)(A-C)
CF round
Codeforces Round 1020 (Div. 3) F,G1
Codeforces Round 996 (Div. 2)](https://zhuanlan.zhihu.com/p/17940578316)
Codeforces Round 974 (Div. 3) (A-H)
Codeforces Round 962 (Div. 3) (A-G)
Codeforces Round 668 (Div. 2) (A-E)(思维,树的直径,离线+树状数组)
EPIC Institute of Technology Round Summer 2024 (Div. 1 + Div. 2) (A-E)
Codeforces Round 950 (Div. 3) (A - G)
Codeforces Round 936 (Div. 2)(A-D)
Codeforces Round 578 (Div. 2) (A-E)
Codeforces Round 939 (Div. 2)(A-D)
Codeforces Round 894 (Div. 3) (A-G)
Codeforces Round 892 (Div. 2) (A-D)
Codeforces Round 881 (Div. 3)(A-F1)
Codeforces Round 867 (Div. 3)(D-G1)
Codeforces Round #855 (Div. 3)(D,E)
Codeforces Round 925 (Div. 3) F(拓扑排序)G(组合数学)
Codeforces Round #842 (Div. 2)(A-D)
Good Bye 2022: 2023 is NEAR(A-C)
Codeforces Round #837 (Div. 2)(A-C)
Codeforces Round #838 (Div. 2)(A-C)
atcoder
AtCoder Beginner Contest 362(A-G)(dp,树的重心,ac自动机)
AtCoder Beginner Contest 224(D-F)
AtCoder Beginner Contest 214 E(贪心+数据结构) F(dp)
AtCoder Beginner Contest 215 E(dp) F(二分)
AtCoder Beginner Contest 296 E(拓扑排序) F(逆序对)