1539：简单题 const int N=2e5+5; int n,m,t; int i,j,k; int L[N]; int R[N];void update(int pos,int val,int *c){ for(int i=pos;i<=N;i+=lowbit(i)){ c[i]+=val; }}int sum(int pos,int *c){ int ans=0; for(int i=pos;i;i-=lo... # 树状数组 2023-10-18 51 点赞 0 评论 77 浏览
