摘要： http://acm.hdu.edu.cn/showproblem.php?pid=2871线段树的各种综合单点更新，区间合并View Code 1 #include <cstdio> 2 using namespace std; 3 4 #define lch (rt<<1) 5 #define rch (rt<<1|1) 6 const int N=50010; 7 int u[N],v[N],se; 8 struct node 9 { 10 int l,r; 11 int len() {return r-l+1;} 12 int s,ls,rs,... 阅读全文