摘要：
http://poj.org/problem?id=2352#include <stdio.h>#define Max 17000#define Maxn 320005#define Lowbit(x) x&(-x)#define Rep(i,n) for(i = 0;i < n;i ++)int c[Maxn],r[Max];void update(int n){ while(n < 320005) { c[n] ++; n += Lowbit(n); }}int getSum(int n){ int sum = 0; while(n > 0) { su 阅读全文
