二维线段树

线段树套线段树

数组开二维，外层结点不存值，内层结点存储区间内数之和，更新内层和普通线段树相同，更新外层线段树底层结点和其他结点不同。

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int tree[2000][2000],Mat[512][512];
int n,m,cnt,con;
void build2(int l,int r,int now,int q,int x,int y)
{
    if(l==r)
    {
        tree[q][now]=Mat[x][l];
        return;
    }
    int mid=(l+r)>>1;
    build2(l,mid,now<<1,q,x,y);
    build2(mid+1,r,now<<1|1,q,x,y);
    tree[q][now]=max(tree[q][now<<1],tree[q][now<<1|1]);
}
void build3(int l,int r,int now,int q)
{
    if(l==r)
    {
        tree[q][now]=max(tree[q<<1][now],tree[q<<1|1][now]);
        return;
    }
    int mid=(l+r)>>1;
    build3(l,mid,now<<1,q);
    build3(mid+1,r,now<<1|1,q);
    tree[q][now]=max(tree[q][now<<1],tree[q][now<<1|1]);
}
void build1(int l,int r,int now)
{
    if(l==r)
    {
        build2(1,n,1,now,l,r);
        return;
    }
    int mid=(l+r)>>1;
    build1(l,mid,now<<1);
    build1(mid+1,r,now<<1|1);
    build3(1,n,1,now);
}
int query2(int l,int r,int now,int q,int y1,int y2)
{
    if(y1<=l&&r<=y2)
        return tree[q][now];
    int mid=(l+r)>>1;
    if(y2<=mid)
        return query2(l,mid,now<<1,q,y1,y2);
    else if(y1>mid)
        return query2(mid+1,r,now<<1|1,q,y1,y2);
    else
        return max(query2(l,mid,now<<1,q,y1,y2),query2(mid+1,r,now<<1|1,q,y1,y2));
}
int query1(int l,int r,int now,int x1,int y1,int x2,int y2)
{
    if(x1<=l&&r<=x2)
        return query2(1,n,1,now,y1,y2);
    int mid=(l+r)>>1;
    if(x2<=mid)
        return query1(l,mid,now<<1,x1,y1,x2,y2);
    else if(x1>mid)
        return query1(mid+1,r,now<<1|1,x1,y1,x2,y2);
    else
        return max(query1(l,mid,now<<1,x1,y1,x2,y2),query1(mid+1,r,now<<1|1,x1,y1,x2,y2));
}
int main()
{
    //freopen("1.txt","r",stdin);
    int t;
    cin>>t;
    while(t--)
    {
        int ans=0x7fffffff;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=n;++i)
        {
            for(int j=1;j<=m;++j)
            {
            scanf("%d",&Mat[i][j]);
           // cout<<Mat[i][j]<<' ';
            }
           // cout<<endl;
        }
        build1(1,n,1);
        for(int i=2;i<n;++i)
            for(int j=2;j<m;++j)
        {
            int a,b,c,d,Max,Min;
            a=query1(1,n,1,1,1,i-1,j-1);
            b=query1(1,n,1,1,j+1,i-1,m);
            c=query1(1,n,1,i+1,1,n,j-1);
            d=query1(1,n,1,i+1,j+1,n,m);
            Max=max(a,max(b,max(c,d)));
            Min=min(a,min(b,min(c,d)));
            ans=min(Max-Min,ans);
        }
        printf("%d\n",ans);
    }
    return 0;
}