CF1093G Multidimensional Queries

\(\text{Code}\)

分析在 2022暑假集训

#include <cstdio>
#include <iostream>
#define IN inline
using namespace std;

const int N = 2e5 + 5, INF = 0x3f3f3f3f;
int n, d, a[N][5];

IN void read(int &x) {
	x = 0; char ch = getchar(); int f = 1;
	for(; !isdigit(ch); f = (ch == '-' ? -1 : f), ch = getchar());
	for(; isdigit(ch); x = (x<<3)+(x<<1)+(ch^48), ch = getchar());
	x *= f;
}

struct node{
	int a[33][2];
	IN node() {for(int S = 0; S < (1 << d); S++) a[S][0] = -INF, a[S][1] = INF;}
	IN void merge(node b) {
		for(int S = 0; S < (1 << d); S++)
			a[S][0] = max(a[S][0], b.a[S][0]), a[S][1] = min(a[S][1], b.a[S][1]);
	}
};
	
struct SegmentTree {
	#define ls (p << 1)
	#define rs (ls | 1)
	
	int Mx[N << 2][33], Mn[N << 2][33], tg[33][5];
	IN void Init() {
		for(int S = 0; S < (1 << d); S++)
			for(int i = 0; i < d; i++) if ((S >> i) & 1) tg[S][i] = 1; else tg[S][i] = -1;
	}
	
	IN void pushup(int p) {
		for(int S = 0; S < (1 << d); S++)
			Mx[p][S] = max(Mx[ls][S], Mx[rs][S]), Mn[p][S] = min(Mn[ls][S], Mn[rs][S]);
	}
	void build(int p, int l, int r) {
		if (l == r) {
			for(int S = 0; S < (1 << d); S++) {
				Mx[p][S] = Mn[p][S] = 0;
				for(int i = 0; i < 5; i++)
					Mx[p][S] += tg[S][i] * a[l][i], Mn[p][S] += tg[S][i] * a[l][i];
			}
			return;
		}
		int mid = l + r >> 1;
		build(ls, l, mid), build(rs, mid + 1, r), pushup(p);
	}
	
	void Modify(int p, int l, int r, int x) {
		if (l == r) {
			for(int S = 0; S < (1 << d); S++) {
				Mx[p][S] = Mn[p][S] = 0;
				for(int i = 0; i < 5; i++)
					Mx[p][S] += tg[S][i] * a[x][i], Mn[p][S] += tg[S][i] * a[x][i];
			}
			return;
		}
		int mid = l + r >> 1;
		if (x <= mid) Modify(ls, l, mid, x);
		else Modify(rs, mid + 1, r, x);
		pushup(p);
	}
	node Query(int p, int l, int r, int x, int y) {
		node res;
		if (x <= l && r <= y) {
			for(int S = 0; S < (1 << d); S++)
				res.a[S][0] = max(res.a[S][0], Mx[p][S]), res.a[S][1] = min(res.a[S][1], Mn[p][S]);
			return res;
		}
		int mid = l + r >> 1;
		if (x <= mid) res = Query(ls, l, mid, x, y);
		if (y > mid) res.merge(Query(rs, mid + 1, r, x, y));
		return res;
	}
}T;

int main() {
	read(n), read(d);
	for(int i = 1; i <= n; i++)
		for(int j = 0; j < d; j++) read(a[i][j]);
	int m;
	T.Init(), T.build(1, 1, n), read(m);
	for(int op, l, r; m; --m) {
		read(op), read(l);
		if (op == 1) {
			for(int i = 0; i < d; i++) read(a[l][i]);
			T.Modify(1, 1, n, l);
		}
		else {
			read(r); int ans = 0; node k = T.Query(1, 1, n, l, r);
			for(int S = 0; S < (1 << d); S++) ans = max(ans, k.a[S][0] - k.a[S][1]);
			printf("%d\n", ans);
		}
	}
}

标签：ch,CF1093G,int,void,mid,read,Queries,isdigit,Multidimensional
来源： https://www.cnblogs.com/leiyuanze/p/16479607.html