线段树的模板

最新推荐文章于 2024-10-11 21:43:15 发布

Faullest

最新推荐文章于 2024-10-11 21:43:15 发布

阅读量106

点赞数

分类专栏：重新努力

本文链接：https://blog.youkuaiyun.com/qq_42821571/article/details/88852623

版权

重新努力专栏收录该内容

18 篇文章

订阅专栏

其实就是 OJ 1244,1243
1243

#include<bits/stdc++.h>
using namespace std;
const int maxxn = 400020;

int n;
int a[maxxn];
struct node {
	int l,r,dat;
};
node t[maxxn];

inline void Ww (int x) {
	if (x == 0) {
		putchar('0');
		putchar(10);
		return ;
	}
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	char ch[16];
	int num = 0;
	while (x != 0) {
		ch[++num] = (x % 10) + '0'; 
		x = x/10;
	}
	while (num != 0) {
		putchar(ch[num--]);
	}
	putchar(10);
}
inline void remax (int x) {
	t[x].dat = max (t[x << 1].dat,t[x << 1 | 1].dat);
}
inline int Read () {
	int xx = 0;
	int ff = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0') {
		if (ch == '-') ff = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		xx = (xx << 1) + (xx << 3) + (ch ^ 48);
		ch = getchar();
	}
	return xx * ff;
}
inline void build (int p,int l,int r) {
	t[p].l = l; t[p].r = r;
	if (l == r) {
		t[p].dat = a[l];
		return ;
	}
	int mid = l + r >> 1;
	build (p << 1,l,mid);
	build (p << 1 | 1,mid + 1,r);
	remax(p);
}
inline void change (int p,int x,int v) {
	if (t[p].l == t[p].r) {
		t[p].dat = v;
		return;
	}
	int mid = t[p].l + t[p].r >> 1;
	if (x > mid) change(p << 1 | 1,x,v);
	else change(p << 1,x,v);
	t[p].dat = max(t[p << 1].dat,t[p << 1 | 1].dat);
}
inline int ass (int p,int l,int r) {
	if (l <= t[p].l && r >= t[p].r) {
		return t[p].dat;
	}
	int mid = t[p].l + t[p].r >> 1;
	int maxx = -9999999;
	if (l <= mid) maxx = max(maxx,ass (p << 1,l,r));
	if (r > mid) maxx = max(maxx,ass (p << 1 | 1,l,r));
	return maxx;
}

int main () {
	n = Read();
	memset(a,0,sizeof(a));
	build(1,1,n);
	int aa,bb,cc;
	for (int i = 1;i <= n;i++) {
		aa = Read(); bb = Read(); cc = Read();
		if (aa == 1) {
			change(1,bb,cc);
		}
		else {
			Ww(ass(1,bb,cc));
		}
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int maxxn = 400020;

int adp[maxxn];
int n;
int a[maxxn];
struct node {
	int l,r,dat,maxid;
};
node t[maxxn];

inline void spread (int x) {
	if (adp[x]) {
		t[x << 1 | 1].dat += adp[x];
		t[x << 1].dat += adp[x]; 
		adp[x << 1 | 1] += adp[x];
		adp[x << 1] += adp[x];
		adp[x] = 0;
	}
}
inline void Ww (int x) {
	if (x == 0) {
		putchar('0');
		putchar(10);
		return ;
	}
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	char ch[16];
	int num = 0;
	while (x != 0) {
		ch[++num] = (x % 10) + '0'; 
		x = x/10;
	}
	while (num != 0) {
		putchar(ch[num--]);
	}
	putchar(10);
}
inline void remax (int x) {
	t[x].dat = max (t[x << 1].dat,t[x << 1 | 1].dat);
}
inline int Read () {
	int xx = 0;
	int ff = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0') {
		if (ch == '-') ff = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		xx = (xx << 1) + (xx << 3) + (ch ^ 48);
		ch = getchar();
	}
	return xx * ff;
}
inline void build (int p,int l,int r) {
	t[p].l = l; t[p].r = r;
	if (l == r) {
		t[p].dat = a[l];
		return ;
	}
	int mid = l + r >> 1;
	build (p << 1,l,mid);
	build (p << 1 | 1,mid + 1,r);
	remax(p);
}
inline void change (int p,int l,int r) {
	if (l <= t[p].l && t[p].r <= r) {
		t[p].dat++;
		adp[p]++;
		return ;
	}
	int mid = t[p].l + t[p].r >> 1;
	spread(p);
	if (l <= mid) change(p << 1,l,r);
	if (r > mid) change(p << 1 | 1,l,r);
	t[p].dat = max(t[p << 1].dat,t[p << 1 | 1].dat);
}
inline int ass (int p,int l,int r) {
	if (l <= t[p].l && r >= t[p].r) {
		return t[p].dat;
	}
	spread(p);
	int mid = t[p].l + t[p].r >> 1;
	int maxx = -9999999;
	if (l <= mid) maxx = max(maxx,ass (p << 1,l,r));
	if (r > mid) maxx = max(maxx,ass (p << 1 | 1,l,r));
	return maxx;
}

int main () {
	n = Read();
	memset(a,0,sizeof(a));
	build(1,1,n);
	int aa,bb,cc;
	for (int i = 1;i <= n;i++) {
		aa = Read(); bb = Read(); cc = Read();
		if (aa == 1) {
			change(1,bb,cc);
		}
		else {
			Ww(ass(1,bb,cc));
		}
	}
	return 0;
}

luogu模板1

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100000 * 4 + 20;
const int maxxn = 100009;
#define LL long long

LL n,m;
LL a[maxxn];
struct node {
	LL l,r;
	LL sum;
	LL Add;
	#define sum(x) t[x].sum
	#define l(x) t[x].l
	#define r(x) t[x].r
	#define add(x) t[x].Add
};
node t[maxn];

inline void spread (LL x) {
	if (add(x) != 0) {
		sum(x << 1) += (r(x << 1) - l(x << 1) + 1) * add(x);
		sum(x << 1 | 1) += (r(x << 1 | 1) - l(x << 1 | 1) + 1) * add(x);
		add(x << 1 | 1) += add(x);
		add(x << 1) += add(x);
		add(x) = 0;
	}
}
void build (LL p,LL l,LL r) {
	t[p].l = l; t[p].r = r;
	if (l == r) {
		t[p].sum = a[l];
		return ;
	}
	LL mid = l + r >> 1;
	build(p << 1,l,mid);
	build(p << 1 | 1,mid + 1,r);
	sum(p) = sum(p << 1) + sum(p << 1 | 1);
	return ;
}
inline void change (LL p,LL l,LL r,LL v) {
	if (l <= t[p].l && t[p].r <= r) {
		t[p].sum += v * (r(p) - l(p) + 1);
		add(p) += v;
		return ;
	}
	spread(p);
	LL mid = l(p) + r(p) >> 1;
	if (l <= mid) change(p << 1,l,r,v);
	if (r > mid) change(p << 1 | 1,l,r,v);
	sum(p) = sum(p << 1) + sum(p << 1 | 1);
	return ;
}
inline LL ass (int p,int l,int r) {
	if (l <= l(p) && r(p) <= r) {
		return sum(p);
	}
	spread(p);
	LL mid = l(p) + r(p) >> 1;
	LL ans = 0;
	if (l <=  mid) ans += ass(p << 1,l,r);
	if (r > mid) ans += ass(p << 1 | 1,l,r);
	return ans;
}
inline LL Read () {
	LL xx = 0;
	LL ff = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0') {
		if (ch == '-') ff = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		xx = (xx << 1) + (xx << 3) + (ch ^ 48);
		ch = getchar();
	}
	return xx * ff;
}
inline void WW (LL x) {
	if (x == 0) {
		putchar('0');
		putchar(10);
		return ;
	}
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	LL num = 0;
	char ch[64];
	while (x != 0) {
		ch[++num] = (x % 10) + '0';
		x /= 10;
	}
	while (num != 0) {
		putchar(ch[num--]);
	}
	putchar(10);
	return ;
}

int main () {
	n = Read(); m = Read();
	for (int i = 1;i <= n;i++) {
		a[i] = Read();
	}
	build (1,1,n);
	for (int i = 1;i <= m;i++) {
		LL aa = Read();
		LL bb = Read();
		LL cc = Read();
		if (aa == 1) {
			LL dd = Read();
			change(1,bb,cc,dd);
		}
		else WW(ass(1,bb,cc));
	}
}

luogu模板2

#include<bits/stdc++.h>
using namespace std;
const int maxn = 100000 * 4 + 20;
const int maxxn = 100010;
typedef long long LL;

LL qq;
LL n,m;
LL a[maxxn];
struct node {
	LL l,r;
	LL sum;
	LL Add;
	LL ride;
	#define ride(x) t[x].ride
	#define sum(x) t[x].sum
	#define l(x) t[x].l
	#define r(x) t[x].r
	#define add(x) t[x].Add
};
node t[maxn];

void build (LL p,LL l,LL r) {
	add(p) = 0;
	ride(p) = 1;
	l(p) = l; r(p) = r;
	if (l == r) {
		sum(p) = a[l] % qq;
		return ;
	}
	LL mid = (l + r) >> 1;
	build(p << 1,l,mid);
	build(p << 1 | 1,mid + 1,r);
	sum(p) += (sum(p << 1) + sum(p << 1 | 1)) %qq;
}
inline void pushdown(LL now)
{
	if (add(now) != 0 || ride(now) != 1) {
	LL l = l(now);
	LL r = r(now);
	LL mid=(l+r)>>1;
	t[now<<1].sum=( (t[now<<1].sum*t[now].ride)%qq +(mid-l+1)*t[now].Add)%qq;
	t[now<<1|1].sum=( (t[now<<1|1].sum*t[now].ride)%qq +(r-mid)*t[now].Add)%qq;
	t[now<<1].ride=(t[now<<1].ride*t[now].ride)%qq;
	t[now<<1|1].ride=(t[now<<1|1].ride*t[now].ride)%qq;
	t[now<<1].Add=( (t[now<<1].Add*t[now].ride)%qq +t[now].Add)%qq;
	t[now<<1|1].Add=( (t[now<<1|1].Add*t[now].ride)%qq +t[now].Add)%qq;
	t[now].Add=0,t[now].ride=1;	
	}
	
	return ;
}
inline void change (LL p,LL l,LL r,LL v) {
	if (l <= l(p) && r(p) <= r) {
		sum(p) += (r(p) - l(p) + 1) * v;
		add(p) += v;
		sum(p) %= qq; 
		add(p) %= qq;
		return ;
	}
	pushdown(p);
	LL mid = (l(p) + r(p)) >> 1;
	if (l <= mid) {
		change(p << 1,l,r,v);	
	} 
	if (r > mid) {
		change(p << 1 | 1,l,r,v);	
	} 
	sum(p) = (sum(p << 1) + sum(p << 1 | 1)) % qq;
	return ;
}
inline void rr (LL p,LL l,LL r,LL v) {
	if (l <= l(p) && r(p) <= r) {
		sum(p) *= v;
		sum(p) %= qq;
		add(p) = (add(p) * v) %qq;
		ride(p) *= v;
		ride(p) %= qq;
		return ;
	}
 	pushdown(p);
	LL mid = (l(p) + r(p)) >> 1;
	if (l <= mid) rr(p << 1,l,r,v);
	if (r > mid) rr(p << 1 | 1,l,r,v);
	sum(p) = (sum(p << 1) + sum (p << 1 | 1)) %qq;
	return ;
}
inline LL Read () {
	LL xx = 0;
	LL ff = 1;
	char ch = getchar();
	while (ch > '9' || ch < '0') {
		if (ch == '-') ff = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		xx = (xx << 1) + (xx << 3) + (ch ^ 48);
		ch = getchar();
	}
	return xx * ff;
}
inline LL ass (LL p,LL l,LL r) {
	if (l <= l(p) && r(p) <= r) {
		return sum(p) % qq;
	}
 	pushdown(p);
	LL mid = (l(p) + r(p)) >> 1;
	LL ans = 0;
	if (l <= mid) ans += ass(p << 1,l,r);
	if (r > mid) ans += ass(p << 1 | 1,l,r);
	return ans % qq;
}
inline void WW (LL x) {
	if (x == 0) {
		putchar('0');
		putchar(10);
		return ;
	}
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	LL num = 0;
	char ch[64];
	while (x != 0) {
		ch[++num] = (x % 10) + '0';
		x /= 10;
	}
	while (num != 0) {
		putchar(ch[num--]);
	}
	putchar(10);
	return ;
}

int main () {
	n = Read(); m = Read(); qq = Read();
	for (int i = 1;i <= n;i++) {
		a[i] = Read();
	}
	build(1,1,n);
	LL aa,bb,cc,dd;
	for (int i = 1;i <= m;i++) {
		aa = Read(); bb = Read(); cc = Read(); 
		if (aa == 1) {
			dd = Read();
			rr(1,bb,cc,dd);
		}
		if (aa == 2) {
			dd = Read();
			change(1,bb,cc,dd);
		}
		if (aa == 3) {
			WW(ass(1,bb,cc));
		}
	}
	return 0;
}