BanFcc

#includeusing namespace std;const int MAXN=(int)1e5+10;struct node{ int l,r,sum;}T[MAXN*40];int root[MAXN],a[MAXN],cnt;vectorv;void insert(int l,int r,int &x,int y,int pos){ x=++cnt;T[x]

#includeusing namespace std;const int MAXN =(int)1e5+5;struct node{ int vl,l,r;}T[MAXN*40];vectorv;int a[MAXN],cnt,root[MAXN];void insert(int l,int r,int &x,int y,int pos){ x=++cnt;T[x]

题目离线：树状数组#includeusing namespace std;typedef long long ll;const int MAXN=(int)3e4+10;struct node{ int l,r,idx;}qu[200010];bool cmp(const node &a,const node &b){ return a.r<b.r;}vectorv

题目主席树+LCA#include#include#include#include#includeusing namespace std;const int MAXN=(int)1e5+5;struct edge{ int to,nxt;}ed[MAXN<<1];int head[MAXN],cnt;void addedge(int u,int v){ ed[cnt

做法同树上第K大#include#include#include#include#includeusing namespace std;const int MAXN =(int)1e5+10;typedef long long ll;int vl[MAXN],n,m,vsz;vectorve;int root[MAXN],ls[MAXN*40],rs[MAXN*40],tot,