2021九月暂记

9.4~9.6

T1 集合
T2 树链剖分，树状数组
T3 函数，性质

2021.9.7-2021.9.9

T1 数学，期望 A：推理与性质
T2 字符串，数据结构 A：暴力，遍历顺序优化
T3 合法括号，图论，最短合法路径
T3 容斥计数

2021.9.10-2021.9.13

T1 性质，贪心 A’
comments:
a method of minimum cost is that A moves several steps and stops at a node,which its id is smaller than the start node,so that B can take more steps to reach the node 1.Figure out that for each i,which means that we start from the original node and on the way of moving,the maximum id is smaller than i,f(i) is the smallest number on the way.Then use greedy algorithm,we set a limit at the beginning,and let it be s + t,A and B try to move without the sum of the nodes where they are exceeding the limit and if neither of them can move,just loose the limit,which means let it add 1;

• T2 数学，gcd，枚举修改点，考虑贡献

T3 DP，二进制运算

2021.9.14-2021.9.17

• T1 性质，贪心

T2 最小生成树，连通块，构造
T3 建图，DP 计数，容斥

2021.9.17-2021.9.19

T1 图论，性质，欧拉回路，简单环
T2 树的直径，性质
T3 区间 DP 进阶

2021.9.20

T1 DP A’ 薄弱
T2 折半搜索
T3 树形 DP
T4 线段树，二分

9.26

T1 性质，数学 A’
Comments:

1	2	3	4	5	6	7	8	9	10	11
1		1	1		1		1
	2		2	2		2		2
		3		3	3		3		3
			4		4	4		4		4
				5		5	5		5
					6		6	6		6
						7		7	7
							8		8	8
								9		9

发现最多使用不超过 4 种颜色

T2 函数，三分
T3 树上距离，树上差分
T4 线段树

P1525 [NOIP2010 提高组] 关押罪犯
comments:
并查集使用技巧：敌人的敌人是朋友
考虑二分图判定+二分

2021.9.29

T1 DP A’ 薄弱
T2 贪心
T3 线段树，贪心，二分
T4 差分，DP，树形结构