题目描述
线段树水题专项赛:Portal
给出一个n*n的矩阵,有m次询问,每次询问以(x,y)为左上角,边长为k的正方形内的最大值与最小值之差。(
n≤250
,
k≤n
,
m≤106
事先给定,每次询问只有
x,y≤n−k+1
)
题目解析
又是一道思博题,于是我就思博了,当我写完了树套树,以为自己
mlog2n
的算法可以过时,我T了,之后想了很久才发现,一共也才
n2=62500
个点,大大小于
m=106
。
我也是醉了aaaaaaaaaaaaaaa。
代码
#include<iostream>
#include<cstring>
#include<cstdio>
#include<set>
#include<algorithm>
using namespace std;
#define MAXN 250
#define MAXM 1000000
#define INF 0x3f3f3f3f
typedef long long int LL;
template<class T>
void Read(T &x){
x=0;char c=getchar();bool flag=0;
while(c<'0'||'9'<c){if(c=='-')flag=1;c=getchar();}
while('0'<=c&&c<='9'){x=x*10+c-'0';c=getchar();}
if(flag)x=-x;
}
int n,k,m;
int A[MAXN+10][MAXN+10];
struct Seg_Tree{
int maxh[MAXN*3],minh[MAXN*3];
void init(){
memset(maxh,0,sizeof(maxh));
memset(minh,0x3f,sizeof(minh));
}
void insert(int &row,int pos,int ll,int rr,int x){
maxh[x]=max(maxh[x],A[row][pos]);
minh[x]=min(minh[x],A[row][pos]);
if(ll==rr)return;
int mid=(ll+rr)>>1;
if(pos<=mid)insert(row,pos,ll,mid,x<<1);
else insert(row,pos,mid+1,rr,x<<1|1);
}
int querymax(int l,int r,int ll,int rr,int x){
if(l<=ll&&rr<=r)return maxh[x];
int mid=(ll+rr)>>1;
int rn=0;
if(l<=mid)rn=max(rn,querymax(l,r,ll,mid,x<<1));
if(mid<r)rn=max(rn,querymax(l,r,mid+1,rr,x<<1|1));
return rn;
}
int querymin(int l,int r,int ll,int rr,int x){
if(l<=ll&&rr<=r)return minh[x];
int mid=(ll+rr)>>1;
int rn=INF;
if(l<=mid)rn=min(rn,querymin(l,r,ll,mid,x<<1));
if(mid<r)rn=min(rn,querymin(l,r,mid+1,rr,x<<1|1));
return rn;
}
}T[MAXN*3];
void build(int l,int r,int x){
T[x].init();
if(l==r)return;
int mid=(l+r)>>1;
build(l,mid,x<<1);
build(mid+1,r,x<<1|1);
}
int row,col;
void insert(int ll,int rr,int x){
T[x].insert(row,col,1,n,1);
if(ll==rr)return;
int mid=(ll+rr)>>1;
if(row<=mid)insert(ll,mid,x<<1);
else insert(mid+1,rr,x<<1|1);
}
int row_l,row_r,col_l,col_r;
int querymax(int ll,int rr,int x){
if(row_l<=ll&&rr<=row_r)
return T[x].querymax(col_l,col_r,1,n,1);
int mid=(ll+rr)>>1;
int rn=0;
if(row_l<=mid)rn=max(rn,querymax(ll,mid,x<<1));
if(mid<row_r)rn=max(rn,querymax(mid+1,rr,x<<1|1));
return rn;
}
int querymin(int ll,int rr,int x){
if(row_l<=ll&&rr<=row_r)
return T[x].querymin(col_l,col_r,1,n,1);
int mid=(ll+rr)>>1;
int rn=INF;
if(row_l<=mid)rn=min(rn,querymin(ll,mid,x<<1));
if(mid<row_r)rn=min(rn,querymin(mid+1,rr,x<<1|1));
return rn;
}
int ans[MAXN+10][MAXN+10];
int main(){
//freopen("jump.in","r",stdin);
//freopen("jump.out","w",stdout);
Read(n),Read(k),Read(m);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)Read(A[i][j]);
build(1,n,1);
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j){
row=i,col=j;
insert(1,n,1);
}
for(int i=1;i<=n-k+1;++i)
for(int j=1;j<=n-k+1;++j){
row_l=i,row_r=i+k-1;
col_l=j,col_r=j+k-1;
ans[i][j]=querymax(1,n,1)-querymin(1,n,1);
}
int x,y;
for(int i=1;i<=m;++i){
Read(x),Read(y);
printf("%d\n",ans[x][y]);
}
}