摘要： 模版题，线段树区间赋值，反转，看别人代码敲的； 1 #include<stdio.h> 2 #include<string.h> 3 #define MAXD 132000 4 #define N 131070 5 int tree[4 * MAXD], rev[4 * MAXD], to[4 * MAXD], a[MAXD]; 6 void build(int cur, int x, int y) 7 { 8 int mid = (x + y) >> 1, ls = cur << 1, rs = (cur << 1) | 1; 9 阅读全文