线段树模板

一.没有区间修改

因为没有区间修改所以无需使用懒标记，可以少写一些代码

例题：（单点修改例题）

 code：

#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int a[N], tr[N << 2];
int tag[N << 2];//懒标记
int n, m;
void bui(int id, int l, int r)//建树
{
	if (l == r) {
		tr[id] = a[l];
		return;
	}
	int mid = l + r >> 1;
	bui(id * 2, l, mid);
	bui(id * 2 + 1, mid + 1, r);
	tr[id] = max(tr[id * 2], tr[id * 2 + 1]);//父节点更新
}
int find(int id, int l, int r, int x, int y)//区间查询
{
	if (x <= l && y >= r) return tr[id];
	int mid = r + l >> 1;
	int ans = -INT_MAX;
	if (x <= mid) ans = max(ans, find(id * 2, l, mid, x, y));
	if (y > mid) ans = max(ans, find(id * 2 + 1, mid + 1, r, x, y));
	return ans;
}void dxg(int id, int l, int r,int x,int v)//对于区间l到r，把下标为x的更新为v
{
	if (l == r) {
		if (tr[id] < v) tr[id] = v;
		return;
	}
	int mid = r + l >> 1;
	if (x <= mid) dxg(id * 2, l, mid, x, v);
	else dxg(id * 2 + 1, mid + 1, r, x, v);
	tr[id] = max(tr[id * 2], tr[id * 2 + 1]);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	bui(1, 1, n);//建树不要忘
	while (m--) {
		char ch;
		cin >> ch;
		if (ch == 'Q') {
			int x, y;
			cin >> x >> y;
			cout << find(1, 1, n, x, y) << endl;
		}
		else {
			int x, v;
			cin >> x >> v;
			dxg(1, 1, n, x, v);
		}
	}
	return 0;
}

二.有区间修改

由于区间修改的存在所以需要使用懒标记

例题：（线段树）

 code：

//记得开long long要不然会wa
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
typedef long long LL;
LL a[N], tr[N << 2];
LL tag[N << 2];//懒标记
int n, m;
void push_up(int id)//父节点更新函数
{
	tr[id] = tr[id << 1] + tr[id << 1 | 1];
}
void push_down(int id, int l, int r)
{
	if (tag[id]) {
		int mid = l + r >> 1;
		tag[id << 1] += tag[id];//懒标记向下传递
		tag[id << 1 | 1] += tag[id];
		tr[id << 1] += tag[id] * (mid - l + 1);
		tr[id << 1 | 1] += tag[id] * (r - mid);
		tag[id] = 0;
	}
}
void bui(int id, int l, int r)//建树
{
	if (l == r) {
		tr[id] = a[l];
		return;
	}
	int mid = l + r >> 1;
	bui(id * 2, l, mid);
	bui(id * 2 + 1, mid + 1, r);
	push_up(id);
}
void qjxg(int id, int l, int r, int x, int y, LL v)
{
	if (x <= l && y >= r) {
		tag[id] += v;
		tr[id] += v * (r - l + 1);
		return;
	}
	push_down(id, l, r);//没返回下移
	int mid = l + r >> 1;
	if (x <= mid) qjxg(id << 1, l, mid, x, y, v);
	if (y > mid) qjxg(id << 1 | 1, mid + 1, r, x, y, v);
	push_up(id);
}
LL find(int id, int l, int r, int x, int y)//区间查询
{
	if (x <= l && y >= r) return tr[id];
	push_down(id, l, r);
	int mid = r + l >> 1;
	LL ans = 0;
	if (x <= mid) ans += find(id << 1, l, mid, x, y);
	if (y > mid) ans += find(id * 2 + 1, mid + 1, r, x, y);
	return ans;
}void dxg(int id, int l, int r, int x, int v)//对于区间l到r，把下标为x的更新为v
{
	if (l == r) {
		if (tr[id] < v) tr[id] = v;
		return;
	}
	int mid = r + l >> 1;
	if (x <= mid) dxg(id * 2, l, mid, x, v);
	else dxg(id * 2 + 1, mid + 1, r, x, v);
	tr[id] = max(tr[id * 2], tr[id * 2 + 1]);
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	bui(1, 1, n);
	while (m--) {
		int p;
		cin >> p;
		if (p == 1) {
			int x, y, k;
			cin >> x >> y >> k;
			qjxg(1, 1, n, x, y, k);
		}
		else if (p == 2) {
			int x, y;
			cin >> x >> y;
			cout << find(1, 1, n, x, y) << "\n";
		}
	}
	return 0;
}