树状数组 背包 模板
//树状数组#define lowbit(x) ((x)&(-x))#define maxn ???int an[maxn];int getsum(int x){ int sum=0; for(int i=x;i>0;i-=lowbit(i)) sum+=an[x]; return sum;}void update(int x,i...
