线段树模板

#include "bits/stdc++.h"
using namespace std;
const int maxn = 1e5 + 7;
int Sum[maxn << 2];
int arr[maxn];
int Add[maxn << 2];

void PushUp(int rt) { Sum[rt] = Sum[rt << 1] + Sum[rt << 1 | 1];}
void Pushdown(int rt, int ln, int rn) {
	if (Add[rt]) {
		Sum[rt << 1] += Add[rt] * ln;
		Sum[rt << 1 | 1] += Add[rt] * rn;
		Add[rt << 1] += Add[rt];
		Add[rt << 1 | 1] += Add[rt];
		Add[rt] = 0;
	}
}
void build(int l, int r, int rt) {
	if (l == r) {
		Sum[rt] = arr[l];
		return;
	}
	int mid = l + ((r - l) >> 1);
	build(l, mid, rt << 1);
	build(mid + 1, r, rt << 1 | 1);
	PushUp(rt);
}

void point_update(int i, int k, int l, int r, int rt) {
	if (l == r) {
		Sum[rt] += k;
		return;
	}
	int mid = l + ((r - l) >> 1);
	Pushdown(rt, mid - l + 1, r - mid);
	if (mid >= i) point_update(i, k, l, mid, rt << 1);
	if (mid < i) point_update(i, k, mid + 1, r, rt << 1 | 1);
	PushUp(rt);
}

void update(int L, int R, int k, int l, int r, int rt) {
	if (L <= l && r <= R) {
		Sum[rt] += k * (r - l + 1);
		Add[rt] += k;
		return;
	}
	int mid = l + ((r - l) >> 1);
	Pushdown(rt, mid - l + 1, r - mid);
	if (mid >= l) update(L, R, k, l, mid, rt << 1);
	if (mid < r) update(L, R, k, mid + 1, r, rt << 1 | 1);
	PushUp(rt);
}

int query1(int l, int r, int L, int R, int rt) {//l, r对应rt
	if (L <= l && r <= R) {
		return Sum[rt];
	}
	int ans = 0;
	int mid = l + ((r - l) >> 1);
	if (mid >= L) ans += query1(l, mid, L, R, rt << 1);
	if (mid < R) ans += query1(mid + 1, r, L, R, rt << 1 | 1);
	return ans;
}

int query2(int l, int r, int L, int R, int rt) {
	if (R <= l && r <= R) {
		return Sum[rt];
	}
	int mid = l + ((r - l) >> 1);
	Pushdown(rt, mid - l + 1, r - mid);
	int ans = 0;
	if (mid >= l) ans += query2(l, mid, L, R, rt << 1);
	if (mid < r) ans += query2(mid + 1, r, L, R, rt << 1 | 1);
	return ans;
}

int point_query(int i, int l, int r, int rt) {
	if (l == r) {
		return Sum[l];
	}
	int mid = l + ((r - l) >> 1);
	Pushdown(rt, mid - l + 1, r - mid);
	if (mid >= i)	return point_query(i, l, mid, rt << 1);
	if (mid < i)	return point_query(i, mid + 1, r, rt << 1 | 1);
}

int main() {


	return 0;
}