树状数组背诵用模板

一维：
int lowbit(x)
{
return (x&(-x));
}
void jiaru(int i,int zhi)
{
for(;i<=n;i+=lowbit(i))
c[i]+=zhi;
}
int qiuhe(int end)
{
int sum=0;
for(;end>=0;end-=lowbit(end))
sum+=c[end];
return sum;

}

二维：

void jiaru(int x,int y,int zhi){    for(int i=x;i<n;i+=lowbit(i))        for(int j=y;j<n;j+=lowbit(j))            c[i][j]+=zhi;}int qiuhe(int x,int y){    int sum=0;    for(int i=x;i>0;i-=lowbit(i))        for(int j=y;j>0;j-=lowbit(j))            sum+=c[i][j];    return sum;}