线段树模板重制

1.并查集模板2023-10-31 2.求质因数模板2023-10-31 3.二分图最大匹配模板(匈牙利算法)2023-12-02 4.欧拉函数模板2023-11-30 5.ST表模板2023-11-26 6.快速幂模板2023-10-31 7.字典树模板2023-12-04 8.矩阵模板2023-12-05 9.Dijkstra单源最短路模板2023-12-09 10.最近公共祖先模板(LCA)2023-12-12 11.拓扑排序模板2023-12-12 12.区间素数筛模板2023-12-16 13.Kruskal和Prim模板2023-12-24 14.树状数组模板2023-12-26 15.二维坐标离散化模板2024-03-07 16.单点修改区间查最值-树状数组模板2024-03-11 17.KMP模板2024-03-11 18.二叉搜索树模板2024-03-30 19.DIjkstra进阶模板路径记录按权重(结点数最小等)记录2024-03-31 20.判断负环模板2024-04-28 21.Exgcd 模板2024-05-03 22.压位高精度模板2024-05-06 23.线段树模板2024-05-12 24.扫描线模板2024-05-18 25.莫队模板2024-07-17 26.带修莫队模板2024-07-17 27.SCC缩点模板2024-07-18 28.取模+组合数2024-07-24 29.FFT 高精度乘法模板2024-07-24 30.字符串自然溢出哈希/单哈希/双哈希模板2024-07-25 31.树模板2024-07-27 32.dsu on tree 模板2024-07-28

33.线段树模板重制2024-08-03

34.主席树模板2024-08-07 35.大数质因数分解模板2024-08-08 36.线段树合并模板2024-08-09 37.int128输入输出流2024-08-09 38.Meissel_Lehmer模板2024-08-09 39.浮点高精度2024-08-13 40.自适应辛普森法2024-10-02 41.unordered_map随机底数种子2024-10-07

 template<class Node>
struct SegmentTree {
#define lc u<<1
#define rc u<<1|1
	const int n, N;
	vector<Node> tr;
 
	SegmentTree(): n(0) {}
	SegmentTree(int n_): n(n_), N(n * 4 + 10) {
		tr.reserve(N);
		tr.resize(N);
	}
	SegmentTree(vector<int> init) : SegmentTree(init.size()) {
		function<void(int, int, int)> build = [&](int u, int l, int r) {
			tr[u].l = l, tr[u].r = r;
			init_lazy(tr[u]);
			if (l == r) {
				tr[u] = {l, r, 0, init[l], init[l], 1, 1};
				return ;
			}
			i64 mid = (l + r) >> 1;
			build(lc, l, mid);
			build(rc, mid + 1, r);
			pushup(tr[u], tr[lc], tr[rc]);
		};
		build(1, 1, n);
	}
 
	void cal_lazy(Node & fa, Node & ch) {
		i64 b = fa.add;
		ch.Max += b;
		ch.Min += b;
	}
 
	void tag_union(Node& fa, Node& ch) {
		i64 b = fa.add;
		ch.add += b;
	}
 
	void init_lazy(Node& u) {
		u.add = 0;
	}
 
	void pushdown(i64 u) {
		if (tr[u].add != 0) {
			cal_lazy(tr[u], tr[lc]);
			cal_lazy(tr[u], tr[rc]);
			tag_union(tr[u], tr[lc]);
			tag_union(tr[u], tr[rc]);
			init_lazy(tr[u]);
		}
	}
 
	void pushup(Node& U, Node& L, Node& R) { //上传
		U.Max = max(L.Max, R.Max);
		U.Min = min(L.Min, R.Min);
 
		if (L.Max < R.Min && L.up && R.up) {
			U.up = 1;
		} else {
			U.up = 0;
		}
 
		if (L.Min > R.Max && L.down && R.down) {
			U.down = 1;
		} else {
			U.down = 0;
		}
 
	}
 
	void modify(int u, int l, int r, int k) {
		if (tr[u].l >= l && tr[u].r <= r) {
			tr[u].add += k;
			tr[u].Max += k;
			tr[u].Min += k;
			return ;
		}
		pushdown(u);
		int mid = (tr[u].l + tr[u].r) >> 1;
		if (l <= mid)
			modify(lc, l, r, k);
		if (r > mid)
			modify(rc, l, r, k);
		pushup(tr[u], tr[lc], tr[rc]);
	}
 
	Node query(int u, int l, int r) { //区查
		if (l <= tr[u].l && tr[u].r <= r)
			return tr[u];
		i64 mid = tr[u].l + tr[u].r >> 1;
		pushdown(u);
		i64 res = LLONG_MIN >> 1;
		if (r <= mid)
			return query(lc, l, r);
		if (l > mid)
			return query(rc, l, r);
		Node U;
		Node L = query(lc, l, r), R = query(rc, l, r);
		pushup(U, L, R);
		return U;
	}
};
 
struct Node { //线段树定义
	i64 l, r, add;
	i64 Max, Min;
	bool up, down;
};

上一篇河南萌新联赛2024第（三）场：河南大学

下一篇2024 暑假友谊赛 3

本文作者：Ke_scholar

本文链接：https://www.cnblogs.com/Kescholar/p/18339951

posted @ 2024-08-03 01:34 Ke_scholar 阅读(18) 评论(0) 编辑收藏举报

刷新页面返回顶部

登录后才能查看或发表评论，立即登录或者逛逛博客园首页

历史上的今天：
2023-08-03 23 暑假友谊赛 No.3
2023-08-03 SMU Summer 2023 Contest Round 9(2019 山东省大学生程序设计竞赛)
2023-08-03 SMU Summer 2023 Contest Round 8(2019 陕西省大学生程序设计竞赛)

Ke_scholar

线段树模板重制

公告

最新随笔

我的标签

合集 (3)

随笔分类 (242)

随笔档案 (228)

阅读排行榜

评论排行榜

推荐排行榜

最新评论

	template<class Node>
	struct SegmentTree {
	#define lc u<<1
	#define rc u<<1\|1
	const int n, N;
	vector<Node> tr;

	SegmentTree(): n(0) {}
	SegmentTree(int n_): n(n_), N(n * 4 + 10) {
	tr.reserve(N);
	tr.resize(N);
	}
	SegmentTree(vector<int> init) : SegmentTree(init.size()) {
	function<void(int, int, int)> build = [&](int u, int l, int r) {
	tr[u].l = l, tr[u].r = r;
	init_lazy(tr[u]);
	if (l == r) {
	tr[u] = {l, r, 0, init[l], init[l], 1, 1};
	return ;
	}
	i64 mid = (l + r) >> 1;
	build(lc, l, mid);
	build(rc, mid + 1, r);
	pushup(tr[u], tr[lc], tr[rc]);
	};
	build(1, 1, n);
	}

	void cal_lazy(Node & fa, Node & ch) {
	i64 b = fa.add;
	ch.Max += b;
	ch.Min += b;
	}

	void tag_union(Node& fa, Node& ch) {
	i64 b = fa.add;
	ch.add += b;
	}

	void init_lazy(Node& u) {
	u.add = 0;
	}

	void pushdown(i64 u) {
	if (tr[u].add != 0) {
	cal_lazy(tr[u], tr[lc]);
	cal_lazy(tr[u], tr[rc]);
	tag_union(tr[u], tr[lc]);
	tag_union(tr[u], tr[rc]);
	init_lazy(tr[u]);
	}
	}

	void pushup(Node& U, Node& L, Node& R) { //上传
	U.Max = max(L.Max, R.Max);
	U.Min = min(L.Min, R.Min);

	if (L.Max < R.Min && L.up && R.up) {
	U.up = 1;
	} else {
	U.up = 0;
	}

	if (L.Min > R.Max && L.down && R.down) {
	U.down = 1;
	} else {
	U.down = 0;
	}

	}

	void modify(int u, int l, int r, int k) {
	if (tr[u].l >= l && tr[u].r <= r) {
	tr[u].add += k;
	tr[u].Max += k;
	tr[u].Min += k;
	return ;
	}
	pushdown(u);
	int mid = (tr[u].l + tr[u].r) >> 1;
	if (l <= mid)
	modify(lc, l, r, k);
	if (r > mid)
	modify(rc, l, r, k);
	pushup(tr[u], tr[lc], tr[rc]);
	}

	Node query(int u, int l, int r) { //区查
	if (l <= tr[u].l && tr[u].r <= r)
	return tr[u];
	i64 mid = tr[u].l + tr[u].r >> 1;
	pushdown(u);
	i64 res = LLONG_MIN >> 1;
	if (r <= mid)
	return query(lc, l, r);
	if (l > mid)
	return query(rc, l, r);
	Node U;
	Node L = query(lc, l, r), R = query(rc, l, r);
	pushup(U, L, R);
	return U;
	}
	};

	struct Node { //线段树定义
	i64 l, r, add;
	i64 Max, Min;
	bool up, down;
	};