摘要: #include#includeint l[100001];int n;int lowbit(int x){ return (x)&(-x);}void update(int pos,int x){ while(pos0) { sum+=l[x]; x-=lowbit(x); } return su... 阅读全文
posted @ 2014-08-09 11:24 一夜成魔 阅读(245) 评论(0) 推荐(0) 编辑