线段树模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
#define lrt rt << 1
#define rrt rt << 1 | 1

int n, m;
int a[maxn];
struct node {
	int l, r;
	ll sum, lazy;
	int mid () { return l + r >> 1; }
	node () { sum = lazy = 0; }
} T[maxn << 2];

inline void pushup (int rt) { T[rt].sum = T[lrt].sum + T[rrt].sum; }
inline void pushdown (int rt) {
	if (T[rt].lazy) {
		T[lrt].lazy += T[rt].lazy;
		T[lrt].sum  += T[rt].lazy * (T[lrt].r - T[lrt].l + 1);
		T[rrt].lazy += T[rt].lazy;
		T[rrt].sum  += T[rt].lazy * (T[rrt].r - T[rrt].l + 1);
		T[rt].lazy  =  0;
	}
}

void build (int l, int r, int rt) {
	T[rt].l = l, T[rt].r = r, T[rt].lazy = 0;
	if (l == r) return (void)(T[rt].sum = a[l]);
	int mid = T[rt].mid();
	build(l, mid, lrt);
	build(mid + 1, r, rrt);
	pushup(rt);
}

void update (int c, int l, int r, int rt) {
	if (T[rt].l >= l && T[rt].r <= r) return (void)(
		T[rt].lazy += c,
		T[rt].sum  += c * (T[rt].r - T[rt].l + 1)
	);
	pushdown(rt);
	int mid = T[rt].mid();
	if (l <= mid) update(c, l, r, lrt);
	if (r >  mid) update(c, l, r, rrt);
	pushup(rt);
}

ll query (int l, int r, int rt) {
	if (T[rt].l >= l && T[rt].r <= r) return T[rt].sum;
	pushdown(rt);
	int mid = T[rt].mid();
	ll res = 0;
	if (l <= mid) res += query(l, r, lrt);
	if (r >  mid) res += query(l, r, rrt);
	return res;
}