2020 CCPC Wannafly Winter Camp Day5 I Practice for KD Tree

二维线段树维护区间最值。

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<climits>
#include<stack>
#include<vector>
#include<queue>
#include<set>
#include<bitset>
#include<map>
//#include<regex>
#include<cstdio>
#pragma GCC optimize(2)
#define up(i,a,b)  for(int i=a;i<b;i++)
#define dw(i,a,b)  for(int i=a;i>b;i--)
#define upd(i,a,b) for(int i=a;i<=b;i++)
#define dwd(i,a,b) for(int i=a;i>=b;i--)
//#define local
typedef long long ll;
typedef unsigned long long ull;
const double esp = 1e-6;
const double pi = acos(-1.0);
const int INF = 0x3f3f3f3f;
const int inf = 1e9;
using namespace std;
ll read()
{
	char ch = getchar(); ll x = 0, f = 1;
	while (ch<'0' || ch>'9') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = x * 10 + ch - '0'; ch = getchar(); }
	return x * f;
}
typedef pair<int, int> pir;
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define lrt root<<1
#define rrt root<<1|1
const int N = 2e3 + 10;
ll grp[N][N];
int n, m1, m2;
void add(int x1, int y1, int x2, int y2,ll val)
{
	grp[x1][y1] += val;
	grp[x2 + 1][y1] -= val;
	grp[x1][y2 + 1] -= val;
	grp[x2 + 1][y2 + 1] += val;
}
ll maxx[N << 2][N << 2];
void updatey(int l, int r, int root, int x, int y, ll val)
{
	maxx[x][root] = max(maxx[x][root], val);
	if (l == r)return;
	int mid = (l + r) >> 1;
	if (y <= mid)updatey(lson, x, y, val);
	else updatey(rson, x, y, val);
}
void updatex(int l, int r, int root, int x, int y, ll val)
{
	updatey(1, n, 1, root, y, val);
	if (l == r)return;
	int mid = (l + r) >> 1;
	if (x <= mid)updatex(lson, x, y, val);
	else updatex(rson, x, y, val);
}
ll queryy(int l, int r, int root, int ylf, int yrt, int xroot)
{
	if (ylf <= l && r <= yrt)
	{
		return maxx[xroot][root];
	}
	ll ans = 0;
	int mid = (l + r) >> 1;
	if (ylf <= mid)ans = max(ans, queryy(lson, ylf, yrt, xroot));
	if (yrt > mid)ans = max(ans, queryy(rson, ylf, yrt, xroot));
	return ans;
}
ll queryx(int l, int r, int root, int xlf, int xrt, int ylf, int yrt)
{
	if (xlf <= l && r <= xrt)
	{
		return queryy(1, n, 1, ylf, yrt, root);
	}
	ll ans = 0;
	int mid = (l + r) >> 1;
	if (xlf <= mid)ans = max(ans, queryx(lson, xlf, xrt, ylf, yrt));
	if (xrt > mid)ans = max(ans, queryx(rson, xlf, xrt, ylf, yrt));
	return ans;
}
int main()
{
	n = read();
	m1 = read(), m2 = read();
	int x1, x2, y1, y2;ll w;
	upd(i, 1, m1)
	{
		x1 = read(), y1 = read(), x2 = read(), y2 = read(); w = read();
		add(x1, y1, x2, y2, w);
	}
	upd(i, 1, n)
	{
		upd(j, 1, n)
		{
			grp[i][j] = grp[i][j] + grp[i - 1][j] + grp[i][j - 1] - grp[i - 1][j - 1];
		}
	}
	upd(i, 1, n)upd(j, 1, n)updatex(1, n, 1, i, j, grp[i][j]);
	while (m2--)
	{
		x1 = read(), y1 = read(), x2 = read(), y2 = read();
		printf("%lld\n", queryx(1, n, 1, x1, x2, y1, y2));
	}
	return 0;
}