树状数组模板

//树状数组c[i]表示当前i-lowbit(i)+1至i的和
int lowbit(int x)//表示此数最低位的1在哪
{
    return x&-x;
}
void update(int x,int N,int d)//找到父亲就一直加lowbit(i)
{
    while(x<=N)
    {
      c[x]+=d;
      x+=lowbit(x);
    }
}
int psum(int x)
{
    int ans=0;
    while(x>0)
    {
        ans+=c[x];
        x-=lowbit(x);
    }
    return ans;
}