树状数组
树状数组 单点修改，区间查询 luogu P3347【模板】树状数组 1 int lowbit(int aa){ return aa&-aa;}void add(int xx,int aa){ for(int i=xx;i<=n;i+=lowbit(i)) t[i]+=aa;}int ask(int xx){ int now=0; for(int i=xx;i>0;i-=lowbit(i)) now+=t[i]; return now;}int main(){ cin>>n>>m; for(int i=1;i<=n;i++) { cin>>a[i]; add(i,a[i]); } for(int...
Hello World
Welcome to Hexo! This is your very first post. Check documentation for more info. If you get any problems when using Hexo, you can find the answer in troubleshooting or you can ask me on GitHub. Quick Start Create a new post $ hexo new "My New Post" More info: Writing Run server $ hexo server More info: Server Generate static files $ hexo generate More info: Generating Deploy to remote sites $ hexo deploy More info: Deployment GitHub Push git add.git commit -m...
