摘要：
http://www.lydsy.com/JudgeOnline/problem.php?id=2658 枚举下边界，补集优化+扫描线+treap。详见题解：http://www.lydsy.com/JudgeOnline/problem.php?id=2658#includeusing name... 阅读全文
摘要：
https://uva.onlinejudge.org/index.php 可持久化fhp-treap。像线段树的可持久化一样自上至下，每次新建log(n)个节点即可。#includeconst int maxn=50015,maxlen=115;using namespace std;int n... 阅读全文