https://vijos.org/p/1512

一個二維樹狀數組，注意樹狀數組不能出現0，把所有坐標+1即可，求子矩陣和為

sub(x2,y2) - sub(x1-1,y2) - sub(x2, y1-1) + sub(x1-1,y1-1) 其中sub為(1,1)到(x,y)矩陣的和。 #include<cstdio> #include<cstring> #include<algorithm> #define ms(i,j) memset(i, j, sizeof(i)); using namespace std; const int maxn = 1024 + 10; int n; int sum[maxn][maxn]; int lowbit(int x) {return x&(-x); } void add(int x, int y, int num) {int i,j;for (i=x; i <= maxn; i += lowbit(i)){for (j=y; j <= maxn; j += lowbit(j)){sum[i][j] += num;}} } int sub(int x, int y) {int ret = 0;int i,j;for (i=x; i > 0; i -= lowbit(i)){for (j=y; j > 0; j -= lowbit(j)){ret += sum[i][j];}}return ret; }int main () { scanf("%d", &n);int m;scanf("%d",&m);while (m!=3){if (m==1){int x,y,k;scanf("%d%d%d", &x, &y, &k);add(x+1,y+1,k);}if (m==2){int x1,y1,x2,y2;scanf("%d%d%d%d", &x1, &y1, &x2, &y2);x1++, x2++, y1++, y2++;int u = sub(x2,y2) - sub(x1-1,y2) - sub(x2, y1-1) + sub(x1-1,y1-1);printf("%d\n", u);}scanf("%d",&m);}return 0; }

轉載于:https://www.cnblogs.com/flyinthesky1/p/6384326.html

總結

以上是生活随笔為你收集整理的|Vijos|树状数组|P1512 SuperBrother打鼹鼠的全部內容，希望文章能夠幫你解決所遇到的問題。

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