随笔分类 -  线段树

[题解] bzoj 3674 可持久化并查集加强版
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=3674 3674: 可持久化并查集加强版 Time Limit: 15 Sec Memory Limit: 256 MB Submit: 4218 Solved: 1557 Descriptio 阅读全文
posted @ 2017-12-16 15:12 lstttt 阅读(156) 评论(0) 推荐(2)
[题解] bzoj 3600 没有人的算数 (替罪羊树+线段树)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=3600 思路 区间操作是线段树无疑,难点在于如何考虑这些数对的大小关系. 我们考虑一下平衡树,如果在平衡树中每个节点放一个数对,我们规定中序遍历前面的数对大于后面的,那么对于任意一个新数对(x, 阅读全文
posted @ 2017-12-11 22:26 lstttt 阅读(224) 评论(0) 推荐(0)
[题解] bzoj 4826 hnoi 2017 影魔(线段树 + 扫描线)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=4826 4826: [Hnoi2017]影魔 Time Limit: 20 Sec Memory Limit: 512 MB Submit: 539 Solved: 293 "[Submit" 阅读全文
posted @ 2017-08-09 21:31 lstttt 阅读(189) 评论(0) 推荐(0)
[题解] poi 2011 Tree Rotations(线段树合并)
摘要：传送门 http://main.edu.pl/en/archive/oi/18/rot http://main.edu.pl/en/user.phtml?op=zasoby (数据) Tree Rotations Memory limit: 64 MB Byteasar the gardener i 阅读全文
posted @ 2017-08-09 10:45 lstttt 阅读(190) 评论(0) 推荐(1)
[题解] bzoj 4869 shoi 2017相逢是问候(线段树+欧拉定理)
摘要：传送门 http://www.lydsy.com/JudgeOnline/problem.php?id=4869 4869: [Shoi2017]相逢是问候 Time Limit: 40 Sec Memory Limit: 512 MB Submit: 823 Solved: 250 "[Submi 阅读全文
posted @ 2017-07-20 21:46 lstttt 阅读(353) 评论(0) 推荐(2)
[题解] poj 2482 Stars in Your Window(线段树+扫描线+面积交)
摘要：传送门 http://poj.org/problem?id=2482 Stars in Your Window | Time Limit: 1000MS | | Memory Limit: 65536K | | Total Submissions: 12409 | | Accepted: 3407 阅读全文
posted @ 2017-07-19 22:09 lstttt 阅读(223) 评论(0) 推荐(0)