分析
别用结构体写了,又乱空间复杂度又高…
理解二维线段树的关键:
- 每个一维线段树的节点都包含着一颗二维线段树;
- 在合并一维线段树的区间时,二维线段树也要同时合并(对应合并)
u_x.u_y.v = lu_x.u_y.v + ru_x.u_y.v ;
注意线段树开4倍空间!!!
时间复杂度O(mlognlogn)
最终板子(单点修改 + 区间查询最值/矩阵和)
板子题没啥好说的,维护最值就行。
代码
#include<iostream>
#include<queue>
#include<cstring>
#include<vector>
#include<stdio.h>
#include<map>
#include<algorithm>
#include<deque>
#include<stack>
#include<set>
#include <unordered_map>
#include<math.h>
#include<string.h>
#define IOS ios::sync_with_stdio(false),cin.tie(0);
using namespace std;
#define pb push_back
#define coutl cout<<"------------"<<endl;
#define fi first
#define se second
#define ire(x) scanf("%d",&x)
#define iire(a,b) scanf("%d %d",&a,&b)
#define lre(x) scanf("%lld",&x)
#define llre(a,b) scanf("%lld %lld",&a,&b)
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define endl "\n"
#define PI acos(-1.0)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<ll, ll> PLL;
typedef pair<double, double> PDD;
typedef pair<double, pair<int, double>> PDID;
typedef pair<char, char> PCC;
typedef pair<char, pair<int, int> > PCII;
typedef pair<int, pair<int, int> > PIII;
typedef pair<int, pair<int, pair<int, int> > > PIIII;
typedef pair<ll, pair<int, int> > PLII;
const int maxn = 1010 + 7;
const int N = 2010 + 7;
const int M = 1e6 + 7;
const int mod = 998244353;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double pi = acos(-1);
const double eps = 1e-8;
ll gcd(ll a,ll b) {return b==0 ? a : gcd(b,a%b);}
ll lcm(ll a,ll b) {return a*b / gcd(a,b);}
ll qmi(ll a,ll b,ll p) {ll ans = 1; while(b) { if(b & 1) ans = ans * a % p; a = a * a % p; b >>= 1; } return ans;}
int lowbit(int x) {return x & (-x);}
ll a[maxn][maxn];
ll tr_max[maxn*4][maxn*4]; //最大值二维线段树
ll tr_min[maxn*4][maxn*4]; //最小值二维线段树
//ll tr_sum[maxn*4][maxn*4]; //求和二维线段树
int n,m;
ll sum,mx,mn; //查询的答案
void pushup_x(int u_x,int u_y) //对一维pushup
{
tr_max[u_x][u_y] = max(tr_max[u_x<<1][u_y],tr_max[u_x<<1|1][u_y]);
tr_min[u_x][u_y] = min(tr_min[u_x<<1][u_y],tr_min[u_x<<1|1][u_y]);
// tr_sum[u_x][u_y] = tr_sum[u_x<<1][u_y] + tr_sum[u_x<<1|1][u_y];
}
void pushup_y(int u_x,int u_y) //对二维pushup
{
tr_max[u_x][u_y] = max(tr_max[u_x][u_y<<1],tr_max[u_x][u_y<<1|1]);
tr_min[u_x][u_y] = min(tr_min[u_x][u_y<<1],tr_min[u_x][u_y<<1|1]);
// tr_sum[u_x][u_y] = tr_sum[u_x][u_y<<1] + tr_sum[u_x][u_y<<1|1];
}
void build_y(int u_x,int u_y,int l,int r,int flag) //第二维线段树,注意flag标记
{
if(l == r)
{
if(flag != -1) tr_max[u_x][u_y] = tr_min[u_x][u_y] = a[flag][l];
else pushup_x(u_x,u_y);
return;
}
int mid = l + r >> 1;
build_y(u_x,u_y<<1,l,mid,flag);
build_y(u_x,u_y<<1|1,mid+1,r,flag);
pushup_y(u_x,u_y);
}
void build_x(int u_x,int l,int r)
{
if(l == r) //一维走到叶子节点对二维建树
{
build_y(u_x,1,1,n,l);
return ;
}
int mid = l + r >> 1;
build_x(u_x<<1,l,mid);
build_x(u_x<<1|1,mid+1,r);
build_y(u_x,1,1,n,-1); //每个一维节点的二维线段树也要更新
}
void update_y(int u_x,int u_y,int l,int r,int y,int val,int flag) //第一维线段树的修改,注意flag标记
{
if(l == r)
{
if(flag) //注意读清楚题意,看是单点修改值还是单点加值
tr_max[u_x][u_y] = tr_min[u_x][u_y] = val;
else pushup_x(u_x,u_y);
return ;
}
int mid = l + r >> 1;
if(y <= mid) update_y(u_x,u_y<<1,l,mid,y,val,flag);
else update_y(u_x,u_y<<1|1,mid+1,r,y,val,flag);
pushup_y(u_x,u_y);
}
void update_x(int u_x,int l,int r,int x,int y,int val) //第一维线段树的修改
{
if(l == r)
{
update_y(u_x,1,1,n,y,val,1);
return ;
}
int mid = l + r >> 1;
if(x <= mid) update_x(u_x<<1,l,mid,x,y,val);
else update_x(u_x<<1|1,mid+1,r,x,y,val);
update_y(u_x,1,1,n,y,val,0); //每个一维节点的二维线段树也要更新
}
void query_y(int u_x,int u_y,int l,int r,int y1,int y2) //第二维线段树的查询
{
if(l >= y1 && r <= y2)
{
mx = max(mx,tr_max[u_x][u_y]);
mn = min(mn,tr_min[u_x][u_y]);
// sum += tr_sum[u_x][u_y];
return ;
}
int mid = l + r >> 1;
if(y1 <= mid) query_y(u_x,u_y<<1,l,mid,y1,y2);
if(y2 > mid) query_y(u_x,u_y<<1|1,mid+1,r,y1,y2);
}
void query_x(int u_x,int l,int r,int x1,int x2,int y1,int y2) //第一维线段树的查询
{
if(l >= x1 && r <= x2)
{
query_y(u_x,1,1,n,y1,y2);
return;
}
int mid = l + r >> 1;
if(x1 <= mid) query_x(u_x<<1,l,mid,x1,x2,y1,y2);
if(x2 > mid) query_x(u_x<<1|1,mid+1,r,x1,x2,y1,y2);
}
void solve(int id)
{
for(int i=0;i<maxn;i++)
for(int j=0;j<maxn;j++) tr_max[i][j] = tr_min[i][j] = 0;
ire(n);
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) scanf("%lld",&a[i][j]);
build_x(1,1,n);
printf("Case #%d:\n",id);
ire(m);
while(m--)
{
int x,y,l;
iire(x,y); ire(l);
l /= 2;
int x1 = max(1,x-l);
int x2 = min(n,x+l);
int y1 = max(1,y-l);
int y2 = min(n,y+l);
mx = -inf;
mn = inf;
query_x(1,1,n,x1,x2,y1,y2);
// cout<<mx<<' '<<mn<<endl;
int ans = mx + mn >> 1;
cout<<ans<<'\n';
update_x(1,1,n,x,y,ans);
}
}
//维护一下最值就行
int main()
{
int t;
ire(t);
for(int i=1;i<=t;i++)
{
solve(i);
}
return 0;
}