摘要：
http://www.notonlysuccess.com/index.php/segment-tree-complete/#include <cstdio>#include <algorithm>using namespace std; #define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1const int maxn = 111111;int h , w , n;int col[maxn<<2];int sum[maxn<<2];void Pus 阅读全文
摘要：
http://www.notonlysuccess.com/index.php/segment-tree-complete/线段树功能:update:单点增减 query:区间求和#include <cstdio> #define lson l , m , rt << 1#define rson m + 1 , r , rt << 1 | 1const int maxn = 55555;int sum[maxn<<2];void PushUP(int rt) { sum[rt] = sum[rt<<1] + sum[rt<< 阅读全文