目录
例题二(综合性很强的线段树题目) 树上二分+mex+树状数组+权值线段树 + 离线操作
动态规划专题典题:
区间dp:
F-来点每日一题_2024牛客寒假算法基础集训营4 (nowcoder.com)
2024牛客寒假集训营4 F -- 来点每日一题-题解CSDN博客
单调队列优化dp:
D. Blocking Elements Codeforces Round 922 (Div. 2)
概率dp/期望dp:
例题一:
(AtCoder Beginner Contest 333)F - Bomb Game 2
(AtCoder Beginner Contest 333)--- F - Bomb Game 2 --- 题解-CSDN博客
例题二:
G - Christmas Color Grid 2 (AtCoder Beginner Contest 334)
状压dp:
例题一:
E - Lucky bag AtCoder Beginner Contest 332
AtCoder Beginner Contest 332 --- E - Lucky bag --- 题解-CSDN博客
SOSDP:(高维前缀和):
树型dp:
例一:
Codeforces Round 928 (Div. 4) G. Vlad and Trouble at MIT
Codeforces Round 928 (Div. 4) G. Vlad and Trouble at MIT-题解CSDN博客
树状数组优化dp:
例一:
H-数三角形(hard)_2024牛客寒假算法基础集训营4 (nowcoder.com)
2024牛客寒假集训营4 -- H数三角形(hard) 题解-CSDN博客
跳表、分块、莫队:
带修改的莫队:
P1903 [国家集训队] 数颜色 / 维护队列 - 洛谷 | 计算机科学教育新生态 (luogu.com.cn)
树上莫队:
A-树上莫队模板题_牛客竞赛数据结构专题班分块、莫队 (nowcoder.com)
数学专题 :
EXGCD -- 扩展欧几里得算法:
例题一:
(AtCoder Beginner Contest 340)F - S = 1
(AtCoder Beginner Contest 340) -- F - S = 1 -- 题解-CSDN博客
例题二:扩展欧几里得+最短路:
Codeforces Round 927 (Div. 3) G. Moving Platforms
Codeforces Round 927 (Div. 3) G. Moving Platforms --- 题解 (非常好的题)-CSDN博客