Skip to content

Instantly share code, notes, and snippets.

@medhruv7
medhruv7 / 2D BIT.cpp
Created March 26, 2019 21:49 — forked from Chillee/2D BIT.cpp
Segment tree
int N, M;
int bit[MAXN][MAXN];
int sum(int x, int y) {
int ret = 0;
for (int i = x; i >= 0; i = (i & (i + 1)) - 1)
for (int j = y; j >= 0; j = (j & (j + 1)) - 1)
ret += bit[i][j];
return ret;
}
void add(int x, int y, int delta) {