accrazypt的博客

树状数组+差分模板整理1.单点查询#include<iostream>#include<cstdio>#include<string.h>#include<cmath>using namespace std;int c[100050],a[100050],x,y,d,n,q;int sum[100050];char s[2];int lowbit(int x){ return x&(-x);}int update(i