hqd_acm的专栏

原创 HDU 4107

线段树的题目 #include #define LL(x) x << 1 #define RR(x) x << 1 | 1 const int MAXN = 200000 + 123; struct NODE { int l, r, rmax, rmin; int lazy; int mid() { return (l + r) >> 1;