2021牛客多校1 J - Journey among Railway Stations 线段树区间合并

题意：有n个站点，下标从1到n，每个站点只有[u, v]的时间内是开放的，列车提前到可以等到开放，但是晚到了不会再开放。从第 i 站到第 i + 1 站花费cost[i]。
有三种操作
0 : 询问列车是否能停靠所有站点， 输出"Yes" / “No”;
1 : 修改i 到 i + 1站点的花费，即cost[i] = w;
2 : 修改站点开放时间，即 u[i] = p; v[i] = q;

思路：
看了题解来的。
能不能从 l 到 r 实际上需要用 max(u’[l],u’[l+1],…,u’[r]) 和v[r]比较。

#include<bits/stdc++.h>
using namespace std;
#define lc i << 1
#define rc i << 1 | 1
#define int long long
#define mem(a, b) memset(a, b, sizeof a)

int read(){
	int x = 0, f = 1;
	char c = 0;
	while(!isdigit(c)){ if(c == '-') f = -1; c = getchar(); }
	while(isdigit(c)){ x = x * 10 + c - '0'; c = getchar(); }
	return x * f;
}
const int N = 1e6 + 5;
const int INF = 0x3f3f3f3f3f3f3f3f;
int n, m, t;
struct node{
	int l, r;
	int maxx, minn, f;
	bool flag;
}e[N << 2];
int u[N], v[N], c[N];
int sum[N];
void eval(node &t, int f){
	t.maxx += f;
	t.minn += f;
	t.f += f;
}
void pushup(int i){
	e[i].maxx = max(e[lc].maxx, e[rc].maxx);
	e[i].minn = min(e[lc].minn, e[rc].minn);
	e[i].flag = (e[lc].flag && e[rc].flag && e[lc].maxx <= e[rc].minn);
}
void pushup(node &u, node &l, node &r){
	u.maxx = max(l.maxx, r.maxx);
	u.minn = min(l.minn, r.minn);
	u.flag = (l.flag && r.flag && l.maxx <= r.minn);
}
void pushdown(int i){
	if(e[i].f){
		eval(e[lc], e[i].f);
		eval(e[rc], e[i].f);
		e[i].f = 0;
	}
}
void build(int i, int l, int r){
	e[i] = {l, r};
	if(l == r){
		e[i].maxx = u[l] + sum[l];
		e[i].minn = v[l] + sum[l];
		e[i].flag = 1;
		return;
	}
	int mid = l + r >> 1;
	build(lc, l, mid); build(rc, mid + 1, r);
	pushup(i);
}
void modify_cost(int i, int l, int r, int v){
	if(l <= e[i].l && e[i].r <= r){
		e[i].maxx += v; 
		e[i].minn += v;
		e[i].f += v;
		return;
	}
	pushdown(i);
	int mid = e[i].l + e[i].r >> 1;
	if(l <= mid) modify_cost(lc, l, r, v);
	if(r > mid) modify_cost(rc, l, r, v);
	pushup(i);
}
void modify_time(int i, int x, int b, int d){
	if(e[i].l == e[i].r){
		e[i].maxx += b;
		e[i].minn += d;
		return;
	}
	pushdown(i);
	int mid = e[i].l + e[i].r >> 1;
	if(x <= mid) modify_time(lc, x, b, d);
	else modify_time(rc, x, b, d);
	pushup(i);
}
node query(int i, int l, int r){
	if(l <= e[i].l && e[i].r <= r) return e[i];
	int mid = e[i].l + e[i].r >> 1;
	pushdown(i);
	node l1, r1, u;
	l1 = r1 = {0, 0, -INF, INF, 0, 1};
	if(l <= mid) l1 = query(lc, l, r);
	if(r > mid) r1 = query(rc, l, r);
	pushup(u, l1, r1);
	return u;
}
signed main(){
	t = read();
	while(t --){
		n = read();
		for(int i = 1; i <= n; i ++) u[i] = read();
		for(int i = 1; i <= n; i ++) v[i] = read();
		for(int i = 1; i <  n; i ++) c[i] = read();
		sum[n] = 0;
		for(int i = n - 1; i; i --) sum[i] = sum[i + 1] + c[i];
		build(1, 1, n);
		m = read();
		while(m --){
			int op, l, r, i, w, p, q;
			op = read();
			if(op == 0){
				l = read(); r = read();
				query(1, l, r).flag ? puts("Yes") : puts("No");
			}
			else if(op == 1){
				i = read(); w = read();
				modify_cost(1, 1, i, w - c[i]);
				c[i] = w;
			}
			else{
				i = read(); p = read(); q = read();
				modify_time(1, i, p - u[i], q - v[i]);
				u[i] = p; v[i] = q;
			}
		}
	}
}