HDU 4819 Mosaic 二维线段树

题目：

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

题意：

初始给出一个$n*n$的矩阵，每次一个操作：给出$x\ y\ L$，意思是以$(x\ y)$为中心，以$L/2$为长，向四周扩展成一个$L*L$矩形，若扩展的矩形超出了$n*n$矩形的范围，那么只取在范围的值，求出这个矩形内的最大值和最小值，最大值与最小值的和的一半作为$(x\ y)$位置的新值，并输出这个值

思路：

二维线段树题目。两年前居然做过这题，当时朴素的写了n棵线段树，在UVAlive上过了，但在杭电上TLE了，今天才发现。。。

#include <bits/stdc++.h>

using namespace std;

const int N = 800 + 10, INF = 0x3f3f3f3f;

int n, maxx, minn;
int cas = 0;
int a[N][N];
int maxv[N<<2][N<<2], minv[N<<2][N<<2];
void push_upy(int ky, int kx)
{
    maxv[kx][ky] = max(maxv[kx][ky<<1], maxv[kx][ky<<1|1]);
    minv[kx][ky] = min(minv[kx][ky<<1], minv[kx][ky<<1|1]);
}
void push_upx(int ky, int kx)
{
    maxv[kx][ky] = max(maxv[kx<<1][ky], maxv[kx<<1|1][ky]);
    minv[kx][ky] = min(minv[kx<<1][ky], minv[kx<<1|1][ky]);
}
void buildy(int L, int R, int ky, int kx, int row, int f)
{
    if(L == R)
    {
        if(f) maxv[kx][ky] = minv[kx][ky] = a[row][L];
        else push_upx(ky, kx);
        return;
    }
    int mid = (L + R) >> 1;
    buildy(L, mid, ky << 1, kx, row, f);
    buildy(mid + 1, R, ky << 1|1, kx, row, f);
    push_upy(ky, kx);
}
void buildx(int L, int R, int kx)
{
    if(L == R)
    {
        buildy(1, n, 1, kx, L, 1); return;
    }
    int mid = (L + R) >> 1;
    buildx(L, mid, kx << 1);
    buildx(mid + 1, R, kx << 1|1);
    buildy(1, n, 1, kx, 0, 0);
}
void updatey(int y, int L, int R, int ky, int kx, int val, int f)
{
    if(y == L && y == R)
    {
        if(f) maxv[kx][ky] = minv[kx][ky] = val;
        else push_upx(ky, kx);
        return;
    }
    int mid = (L + R) >> 1;
    if(y <= mid) updatey(y, L, mid, ky << 1, kx, val, f);
    else updatey(y, mid + 1, R, ky << 1|1, kx, val, f);
    push_upy(ky, kx);
}
void updatex(int x, int y, int L, int R, int kx, int val)
{
    if(x == L && x == R)
    {
        updatey(y, 1, n, 1, kx, val, 1); return;
    }
    int mid = (L + R) >> 1;
    if(x <= mid) updatex(x, y, L, mid, kx << 1, val);
    else updatex(x, y, mid + 1, R, kx << 1|1, val);
    updatey(y, 1, n, 1, kx, 0, 0);
}
void queryy(int ly, int ry, int L, int R, int ky, int kx)
{
    if(ly <= L && R <= ry)
    {
        maxx = max(maxx, maxv[kx][ky]), minn = min(minn, minv[kx][ky]); return;
    }
    int mid = (L + R) >> 1;
    if(ly <= mid) queryy(ly, ry, L, mid, ky << 1, kx);
    if(ry > mid) queryy(ly, ry, mid + 1, R, ky << 1|1, kx);
}
void queryx(int lx, int rx, int ly, int ry, int L, int R, int kx)
{
    if(lx <= L && R <= rx)
    {
        queryy(ly, ry, 1, n, 1, kx); return;
    }
    int mid = (L + R) >> 1;
    if(lx <= mid) queryx(lx, rx, ly, ry, L, mid, kx << 1);
    if(rx > mid) queryx(lx, rx, ly, ry, mid + 1, R, kx << 1|1);
}
int main()
{
    int t, m;
    scanf("%d", &t);
    while(t--)
    {
        scanf("%d", &n);
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d", &a[i][j]);
        buildx(1, n, 1);
        scanf("%d", &m);
        int x, y, sz;
        printf("Case #%d:\n", ++cas);
        for(int i = 1; i <= m; i++)
        {
            scanf("%d%d%d", &x, &y, &sz);
            int x1 = max(1, x - sz / 2), x2 = min(n, x + sz / 2);
            int y1 = max(1, y - sz / 2), y2 = min(n, y + sz / 2);
            maxx = -INF, minn = INF;
            queryx(x1, x2, y1, y2, 1, n, 1);
            int ans = (maxx + minn) / 2;
            printf("%d\n", ans);
            updatex(x, y, 1, n, 1, ans);
        }
    }
    return 0;
}