Mosaic

 http://acm.hdu.edu.cn/showproblem.php?pid=4819

题意：n*n矩阵每次查询(x,y) 将其修改成l范围内最小最大值和得一半，每次输出这一半的值；

反思：二维线段树理解不够~~，更新值时是要先对修改行做赋值操作，再更新其他行的子树的最值~；

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1000+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;
    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

int n,m,k;
int tree_min[maxn<<2][maxn<<2];
int tree_max[maxn<<2][maxn<<2];
void subbuild(int rt,int l,int r,int t)
{
    tree_max[t][rt]=0;
    tree_min[t][rt]=INF;
    if(l!=r)
    {
        int mid=(l+r)>>1;
        subbuild(lson,t);
        subbuild(rson,t);
    }
}
void build(int rt,int l,int r)
{
    subbuild(1,1,n,rt);
    if(l!=r)
    {
        int mid=(l+r)>>1;
        build(lson);
        build(rson);
    }
}
void subupdate(int rt,int l,int r,int y,int t,int val,bool f)
{
	if(l==r&&l==y)
	{
	    if(f)
        {
            tree_max[t][rt]=val;//查询后的更新后是直接赋值不是取最值！！
            tree_min[t][rt]=val;
        }
	   else
       {
            tree_max[t][rt]=max(tree_max[t<<1][rt],tree_max[t<<1|1][rt]);//不是修改行就更新行的子树
            tree_min[t][rt]=min(tree_min[t<<1][rt],tree_min[t<<1|1][rt]);
       }
	}
	else
	{
		int mid=(l+r)>>1;
		if(y<=mid) subupdate(lson,y,t,val,f);
		else       subupdate(rson,y,t,val,f);
		tree_max[t][rt]=max(tree_max[t][rt<<1],tree_max[t][rt<<1|1]);
		tree_min[t][rt]=min(tree_min[t][rt<<1],tree_min[t][rt<<1|1]);
	}
}
void update(int rt,int l,int r,int x,int y,int val)
{
    if(l==r)
    {
        subupdate(1,1,n,y,rt,val,1);//根包含全部子树所以要更新
        return ;
    }
	if(l!=r)
	{
		int mid=(l+r)>>1;
		if(x<=mid) update(lson,x,y,val);
		else       update(rson,x,y,val);
	}
	subupdate(1,1,n,y,rt,val,0);
}
int subque_max(int rt,int l,int r,int LY,int RY,int t)
{
    if(LY <= l && RY >= r)
        return tree_max[t][rt];
    int mid = (l + r) >> 1;
    int ans = 0;
    if(LY <= mid) ans =max(ans, subque_max(lson,LY,RY,t));
    if(RY > mid ) ans =max(ans, subque_max(rson,LY,RY,t));
    return ans;
}

int que_max(int rt,int l,int r,int LX,int RX,int LY,int RY)
{
    if(LX <= l && RX >= r)
        return subque_max(1,1,n,LY,RY,rt);
    int mid = (l + r) >> 1;
    int ans = 0;
    if(LX <= mid) ans =max(ans, que_max(lson,LX,RX,LY,RY));
    if(RX > mid ) ans =max(ans, que_max(rson,LX,RX,LY,RY));
    return ans;
}
int subque_min(int rt,int l,int r,int LY,int RY,int t)
{
    if(LY <= l && RY >= r)
        return tree_min[t][rt];
    int mid = (l + r) >> 1;
    int ans = INF;
    if(LY <= mid) ans =min(ans, subque_min(lson,LY,RY,t));
    if(RY > mid ) ans =min(ans, subque_min(rson,LY,RY,t));
    return ans;
}

int que_min(int rt,int l,int r,int LX,int RX,int LY,int RY)
{
    if(LX <= l && RX >= r)
        return subque_min(1,1,n,LY,RY,rt);
    int mid = (l + r) >> 1;
    int ans = INF;
    if(LX <= mid) ans =min(ans, que_min(lson,LX,RX,LY,RY));
    if(RX > mid ) ans =min(ans, que_min(rson,LX,RX,LY,RY));
    return ans;
}
int main()
{
    //freopen("input.txt","r",stdin);
    int t;
    scanf("%d",&t);
    int cas=0;
    while(t--)
    {
        printf("Case #%d:\n",++cas);
        scanf("%d",&n);
        build(1,1,n);
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                int x;
                scanf("%d",&x);
                update(1,1,n,i,j,x);
            }
        }
        int q;
        sfi(q);
        while(q--)
        {
            int x,y,l;
            scanf("%d%d%d",&x,&y,&l);
            int x1=max(x-l/2,1);
            int y1=max(y-l/2,1);
            int x2=min(x+l/2,n);
            int y2=min(y+l/2,n);
            int Max=que_max(1,1,n,x1,x2,y1,y2);
            int Min=que_min(1,1,n,x1,x2,y1,y2);
            //cout<<Min<<" "<<Max<<endl;
            int tmp=(Max+Min)/2;
            printf("%d\n",tmp);
            update(1,1,n,x,y,tmp);
        }
    }


	return 0;
}