POJ 1195 Mobile phones 二维线段树

来源：互联网发布：云服务器绑定域名编辑：程序博客网时间：2024/05/17 00:50
题目连接：http://poj.org/problem?id=1195
二维线段树单点更新区间查询
代码：
#include <cstdio>#include <cstring>using namespace std;const int maxn = 1000 + 50;int sum[4 * maxn][4 * maxn];#define lson rt << 1,l,mid#define rson rt << 1 | 1,mid + 1,rint n;//向上更新void PushUp(int rt,int prt){    sum[prt][rt] = sum[prt][rt << 1] + sum[prt][rt << 1 | 1];}//构造二级线段树void SubBuild(int rt,int l,int r,int prt){    sum[prt][rt] = 0;    if(l == r) return;    int mid = l + r >> 1;    SubBuild(lson,prt),SubBuild(rson,prt);}//构造一级线段树void Build(int rt,int l,int r){    SubBuild(1,1,n,rt);    if(l == r) return;    int mid = l + r >> 1;    Build(lson),Build(rson);}//更新二级线段树void SubUpdate(int rt,int l,int r,int x,int v,int prt){    if(l == r){        sum[prt][rt] += v;    }    else{        int mid = l + r >> 1;        if(x <= mid) SubUpdate(lson,x,v,prt);        else SubUpdate(rson,x,v,prt);        PushUp(rt,prt);    }}//更新一级线段树void Update(int rt,int l,int r,int x,int y,int v){    SubUpdate(1,1,n,x,v,rt);    if(l == r) return;    int mid = l + r >> 1;    if(y <= mid) Update(lson,x,y,v);    else Update(rson,x,y,v);}//查询二级线段树 区间查询int SubQuery(int rt,int l,int r,int x1,int x2,int prt){    if(x1 <= l && r <= x2) return sum[prt][rt];    else{        int mid = l + r >> 1;        int ret = 0;        if(x1 <= mid) ret += SubQuery(lson,x1,x2,prt);        if(x2 > mid) ret += SubQuery(rson,x1,x2,prt);        return ret;    }}//查询一级线段树 单点查询int Query(int rt,int l,int r,int x1,int y1,int x2,int y2){    if(y1 <= l && r <= y2) return SubQuery(1,1,n,x1,x2,rt);    else{        int mid = l + r >> 1,ret = 0;        if(y1 <= mid) ret += Query(lson,x1,y1,x2,y2);        if(y2 > mid) ret += Query(rson,x1,y1,x2,y2);        return ret;    }}int main(){    int op,a,b,c,d;    while(scanf("%d",&op)){        if(op == 0){            scanf("%d",&n);            Build(1,1,n);        }        else if(op == 1){            scanf("%d %d %d",&a,&b,&c);            a++,b++;            Update(1,1,n,a,b,c);        }        else if(op == 2){            scanf("%d %d %d %d",&a,&b,&c,&d);            a++,b++,c++,d++;            printf("%d\n",Query(1,1,n,a,b,c,d));        }        else if(op == 3) break;    }    return 0;}
0 0