2021辽宁大学生程序设计省赛完美主义(线段树）

题目链接++++++++++++++++++++++++++++++++++

#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 3e5 + 10;
int n, q;
int a[N];
struct Node {
	int l, r;
	bool flag;
	int mx, mn;
}tr[N * 4];
void pushup(Node &u, Node &l, Node &r)
{
	u.mx = max(l.mx, r.mx);
	u.mn = min(l.mn, r.mn);
	if (l.flag&&r.flag&&l.mx <= r.mn)
		u.flag = true;
	else
		u.flag = false;
}
void pushup(int u)
{
	pushup(tr[u], tr[u << 1], tr[u << 1 | 1]);
}
void build(int u, int l, int r)
{
	if (l == r) tr[u] = { l,r,true,a[l],a[l] };
	else
	{
		tr[u].l = l, tr[u].r = r;
		int mid = l + r >> 1;
		build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
		pushup(u);
	}
}
void modify(int u, int x, int d)
{
	if (tr[u].l== x&&tr[u].r==x)
	{
		tr[u].mx = d;
		tr[u].mn = d;
	}
	else
	{
		int mid = tr[u].l + tr[u].r >> 1;
		if (x <= mid) modify(u << 1, x, d);
		if (x > mid) modify(u << 1 | 1, x, d);
		pushup(u);
	}
}
Node query(int u, int l, int r)
{
	if (tr[u].l >= l && tr[u].r <= r) return tr[u];
	else
	{
		int mid = tr[u].l + tr[u].r >> 1;
		Node left = { 0,0,1,0,1000000000 }, right = { 0,0,1,0,1000000000 };
		if (l <= mid) left = query(u << 1, l, r);
		if (r > mid) right = query(u << 1 | 1, l, r);
		Node res;
		pushup(res, left, right);
		return res;
	}
}
int main()
{
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	build(1, 1, n);
	while (q--)
	{
		int p, x, d;
		scanf("%d%d%d", &p, &x, &d);
		if (p == 1)
		{
			modify(1, x, d);
		}
		else if (p == 2)
		{
			Node t = query(1, x, d);
			if (t.flag)
				printf("Yes\n");
			else
				printf("No\n");
		}
	}
	return 0;
}