树状数组 关键代码

int c[33000];int lowbit(int x){return x&(-x);}void add(int x){while(x<=32001){c[x]++;x+=lowbit(x);}}int find(int x){int sum=0;while(x>0){sum+=c[x];x-=lowbit(x);}return sum;}