ToheartZhang的博客

#include<bits/stdc++.h> using namespace std; const int maxn = 500010; int n, m; int a[maxn], c[maxn];inline void update(int x, int k){ while(x <= n){ c[x] += k; x += x & (-x); }

//树状数组 #include<bits/stdc++.h> using namespace std; const int maxn = 100010; int n, s, haoyu[maxn], c[maxn];struct node{ int x, site; } a[maxn];bool cmp(node p, node q){ return p.x < q.x; }voi