TOJ 3852 Haitang1 三维树状数组

来源：互联网发布：淘宝客联盟编辑：程序博客网时间：2024/06/06 07:00

The portal:http://acm.tju.edu.cn/toj/showp3852.html

Tree Array:

#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;int a[45][45][45];int Insert(int x,int y,int z,int value) {    for(int i = x ; i <= 40 ; i += (i & -i)) {        for(int j = y ; j <= 40 ; j += (j & -j)) {            for(int k = z ; k <= 40 ; k += (k & (-k))){                a[i][j][k] += value;            }        }    }}int Query(int x,int y,int z) {    if(x <= 0 || y <= 0 || z <= 0)return 0;    if(x > 40) x = 40;    if(y > 40) y = 40;    if(z > 40) z = 40;    int ret = 0;    for(int i = x ; i ; i -= (i & -i)) {        for(int j = y ; j ; j -=(j & -j)) {            for(int k = z ; k ; k -= (k & (-k))){                ret += a[i][j][k];            }        }    }    return ret;}void Deal_with() {    int N,Q;    while(~scanf("%d",&N)) {        memset(a,0,sizeof(a));        int x,y,z,a1,b,value;        for(int i = 0 ; i < N ; i++) {            scanf("%d %d %d %d",&x,&y,&z,&value);            Insert(x,y,z,value);        }        scanf("%d",&Q);        for(int j = 0 ; j < Q ; j++) {            scanf("%d %d %d %d %d",&x,&y,&z,&a1,&b);            int x1,y1,z1,x2,y2,z2;            x1 = x + b; y1 = y + b; z1 = z + b;            x2 = x - b - 1; y2 = y - b - 1;z2 = z - b - 1;                        int ans1 =               Query(x1,y1,z1) - Query(x1,y1,z2) - Query(x1,y2,z1) - Query(x2,y1,z1)            + Query(x2,y1,z2) + Query(x1,y2,z2) + Query(x2,y2,z1) - Query(x2,y2,z2);                        x1 = x + a1 - 1; y1 = y + a1 -1; z1 = z + a1 -1;            x2 = x - a1 ; y2 = y - a1;z2 = z - a1;                        int ans2 =               Query(x1,y1,z1) - Query(x1,y1,z2) - Query(x1,y2,z1) - Query(x2,y1,z1)            + Query(x2,y1,z2) + Query(x1,y2,z2) + Query(x2,y2,z1) - Query(x2,y2,z2);            printf("%d\n",ans1-ans2);        }    }}int main(void) {    //freopen("a.in","r",stdin);    Deal_with();    return 0;}

Recursion:

#include <cstdio>#include <cstring>#include <cmath>#include <cstdlib>#include <iostream>#include <algorithm>using namespace std;int a[45][45][45];void Pre_deal(int N) {    for(int i = 1 ; i <= N ; i ++) {        for(int j = 1 ; j <= N ; j++) {            for(int k = 1 ; k <= N ; k++) {                a[i][j][k] += a[i][j][k-1] + a[i][j-1][k] + a[i-1][j][k] + a[i-1][j-1][k-1]                - a[i-1][j-1][k] - a[i-1][j][k-1]-a[i][j-1][k-1];            }        }    }} void Print(int N) {    for(int i = 1 ; i <= N ; i ++) {        for(int j = 1 ; j <= N ; j++) {            for(int k = 1 ; k <= N ; k++) {                printf("%d ",a[i][j][k]);            }            puts("");        }        puts("\n");    }}void Deal_with() {    int N,Q;    while(~scanf("%d",&N)) {        int x,y,z,value,a1,b;        memset(a,0,sizeof(a));        for(int i = 0 ; i < N; i ++) {            scanf("%d %d %d %d",&x,&y,&z,&value);            a[x][y][z] += value;        }        Pre_deal(40);        //Print(4);        scanf("%d",&Q);        int x1,y1,z1,x2,y2,z2;        int ans1,ans2;        for(int i = 1 ; i <= Q ; i++) {            scanf("%d %d %d %d %d",&x,&y,&z,&a1,&b);            x1 = x - b - 1 ; y1 = y - b - 1 ; z1 = z - b -1;            x2 = x + b     ; y2 = y + b ;     z2 = z + b;            if(x1 <  0)x1 =  0; if(z1 <  0)z1 =  0; if(y1 <  0)y1 =  0;            if(x2 > 40)x2 = 40; if(z2 > 40)z2 = 40; if(y2 > 40)y2 = 40;            ans1 =              a[x2][y2][z2] - a[x2][y2][z1] - a[x2][y1][z2] - a[x1][y2][z2]            -a[x1][y1][z1] + a[x1][y1][z2] + a[x2][y1][z1] + a[x1][y2][z1];            x1 = x - a1    ; y1 = y - a1   ; z1 = z - a1 ;            x2 = x + a1  -1; y2 = y + a1 -1; z2 = z + a1 -1;            if(x1 <  0)x1 =  0; if(z1 <  0)z1 =  0; if(y1 <  0)y1 =  0;            if(x2 > 40)x2 = 40; if(z2 > 40)z2 = 40; if(y2 > 40)y2 = 40;            ans2 =              a[x2][y2][z2] - a[x2][y2][z1] - a[x2][y1][z2] - a[x1][y2][z2]            -a[x1][y1][z1] + a[x1][y1][z2] + a[x2][y1][z1] + a[x1][y2][z1];            //printf("%d %d\n",ans1,ans2);            printf("%d\n",ans1-ans2);        }    }}int main(void) {    //freopen("a.in","r",stdin);    Deal_with();    return 0;}

0 0