二維線段樹就是樹套樹，線段樹套線段樹。。。

#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #define REP(i,a,b) for(int i=a;i<=b;i++) #define MS0(a) memset(a,0,sizeof(a)) #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1using namespace std;typedef long long ll; const int maxn=1500; const int INF=1e9+10;int n; int op; int x,y,z; int xt1,yt1,xt2,yt2; struct NodeY {int l,r;int cnt; }; struct NodeX {int l,r;int cnt;NodeY ty[maxn<<2];void up(int rt){ty[rt].cnt=ty[rt<<1].cnt+ty[rt<<1|1].cnt;}void build(int l,int r,int rt){ty[rt].l=l;ty[rt].r=r;ty[rt].cnt=0;if(l==r) return;int m=(l+r)>>1;build(lson);build(rson);up(rt);}void update(int p,int c,int l,int r,int rt){if(l==r){ty[rt].cnt+=c;return;}int m=(l+r)>>1;if(p<=m) update(p,c,lson);else update(p,c,rson);up(rt);}int query(int L,int R,int l,int r,int rt){if(L<=l&&r<=R) return ty[rt].cnt;int m=(l+r)>>1;int res=0;if(L<=m) res+=query(L,R,lson);if(R>m) res+=query(L,R,rson);return res;} };NodeX tx[maxn<<2];void up(int rt) {tx[rt].cnt=tx[rt<<1].cnt+tx[rt<<1|1].cnt; }void build(int l,int r,int rt) {tx[rt].l=l;tx[rt].r=r;tx[rt].cnt=0;tx[rt].build(1,n,1);if(l==r) return;int m=(l+r)>>1;build(lson);build(rson);up(rt); }void update(int x,int y,int c,int l,int r,int rt) {tx[rt].update(y,c,1,n,1);if(l==r) return;int m=(l+r)>>1;if(x<=m) update(x,y,c,lson);else update(x,y,c,rson);up(rt); }int query(int xL,int xR,int yL,int yR,int l,int r,int rt) {if(xL<=l&&r<=xR) return tx[rt].query(yL,yR,1,n,1);int m=(l+r)>>1;int res=0;if(xL<=m) res+=query(xL,xR,yL,yR,lson);if(xR>m) res+=query(xL,xR,yL,yR,rson);return res; }int main() {freopen("in.txt","r",stdin);scanf("%d%d",&op,&n);build(1,n,1);while(~scanf("%d",&op)&&op!=3){if(op==1){scanf("%d%d%d",&x,&y,&z);x++;y++;update(x,y,z,1,n,1);}else{scanf("%d%d%d%d",&xt1,&yt1,&xt2,&yt2);xt1++;yt1++;xt2++;yt2++;printf("%d\n",query(xt1,xt2,yt1,yt2,1,n,1));}}return 0; } View Code

?-----更新

上面那個是利用了求和以及更新增減的特殊性，下面這個才是更實用的普遍做法。

#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #define REP(i,a,b) for(int i=a;i<=b;i++) #define MS0(a) memset(a,0,sizeof(a)) #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1using namespace std;typedef long long ll; const int maxn=1500; const int INF=1e9+10;int op,n; int x,y,a; int xt,yt; int tr[maxn<<2][maxn<<2];void upy(int rt,int rtx) {tr[rtx][rt]=tr[rtx][rt<<1]+tr[rtx][rt<<1|1]; }void buildy(int l,int r,int rt,int rtx) {if(l==r){tr[rtx][rt]=0;return;}int m=(l+r)>>1;buildy(lson,rtx);buildy(rson,rtx);upy(rt,rtx); }void updatey(int p,int c,int l,int r,int rt,int rtx) {if(l==r){tr[rtx][rt]+=c;return;}int m=(l+r)>>1;if(p<=m) updatey(p,c,lson,rtx);else updatey(p,c,rson,rtx);upy(rt,rtx); }int queryy(int L,int R,int l,int r,int rt,int rtx) {if(L<=l&&r<=R) return tr[rtx][rt];int m=(l+r)>>1;int res=0;if(L<=m) res+=queryy(L,R,lson,rtx);if(R>m) res+=queryy(L,R,rson,rtx);return res; }void buildx(int l,int r,int rt) {buildy(1,n,1,rt);if(l==r) return;int m=(l+r)>>1;buildx(lson);buildx(rson); }void upx(int p,int rtx,int l,int r,int rt) {tr[rtx][rt]=tr[rtx<<1][rt]+tr[rtx<<1|1][rt];if(l==r) return;int m=(l+r)>>1;if(p<=m) upx(p,rtx,lson);else upx(p,rtx,rson); }void updatex(int x,int y,int c,int l,int r,int rt) {if(l==r){updatey(y,c,1,n,1,rt);return;}int m=(l+r)>>1;if(x<=m) updatex(x,y,c,lson);else updatex(x,y,c,rson);upx(y,rt,1,n,1); }int queryx(int xL,int xR,int yL,int yR,int l,int r,int rt) {if(xL<=l&&r<=xR) return queryy(yL,yR,1,n,1,rt);int m=(l+r)>>1;int res=0;if(xL<=m) res+=queryx(xL,xR,yL,yR,lson);if(xR>m) res+=queryx(xL,xR,yL,yR,rson);return res; }int main() {freopen("in.txt","r",stdin);scanf("%d%d",&op,&n);buildx(1,n,1);while(~scanf("%d",&op)&&op!=3){if(op==1){scanf("%d%d%d",&x,&y,&a);x++;y++;updatex(x,y,a,1,n,1);}else{scanf("%d%d%d%d",&x,&y,&xt,&yt);x++;y++;xt++;yt++;printf("%d\n",queryx(x,xt,y,yt,1,n,1));}}return 0; } View Code

?

轉載于:https://www.cnblogs.com/--560/p/5243587.html

總結

以上是生活随笔為你收集整理的poj1195 Mobile phones 二维线段树入门的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。