摘要: 浅谈$K D$ $Tree$: "https://www.cnblogs.com/AKMer/p/10387266.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=4066" 裸的强制在线插入点,像替罪羊树那样重建不平衡的子树即可 阅读全文
posted @ 2019-02-17 17:27 AKMer 阅读(123) 评论(0) 推荐(0) 编辑
摘要: 浅谈$K D$ $Tree$: "https://www.cnblogs.com/AKMer/p/10387266.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=4154" 每个节点看做是点$(dfn_i,dep_i)$,然后对 阅读全文
posted @ 2019-02-17 17:24 AKMer 阅读(137) 评论(0) 推荐(0) 编辑
摘要: 浅谈$K D$ $Tree$: "https://www.cnblogs.com/AKMer/p/10387266.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=4303" 把每个元素看成点$(i,a_i)$即可,然后裸的正交范 阅读全文
posted @ 2019-02-17 17:20 AKMer 阅读(132) 评论(0) 推荐(0) 编辑
摘要: 浅谈$K D$ $Tree$: "https://www.cnblogs.com/AKMer/p/10387266.html" 题目传送门: "https://lydsy.com/JudgeOnline/problem.php?id=2648" $K D$ $Tree$最近点查询裸题,注意先把所有点 阅读全文
posted @ 2019-02-17 17:16 AKMer 阅读(143) 评论(0) 推荐(0) 编辑