摘要： hdoj 1166题目大意：解决：树状数组简单题，不解释#include <iostream> #include <cstdio>#include <cstring>using namespace std;#define L(x) (x<<1)#define R(x) (x<<1|1)#define M(x,y) ((x+y)>>1)int n;int c[50005];int lowbit(int x){ return x&(-x);}void updata(int p,int inc){ for(int i=p 阅读全文