两个月前打了个主席树……今天又打了个线段树合并,发现线段树合并的代码挺短的……(其实也差不多)
主席树:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define maxn 100010
using namespace std;
int A[maxn],b[maxn],n,m;
struct array
{
int x,id;
}a[maxn];
bool cmp(array u,array v) {return u.x<v.x;}
struct tree
{
int val,lc,rc;
}tr[maxn*20];
int len=0,root[maxn];
void build(int l,int r)
{
int t=++len;
tr[t].val=0;
if(l<r)
{
int mid=l+r>>1;
tr[t].lc=len+1;build(l,mid);
tr[t].rc=len+1;build(mid+1,r);
}
}
void update(int last,int l,int r,int k)
{
int now=++len;
tr[now]=tr[last];
if(l==r) {tr[now].val++;return;}
int mid=l+r>>1;
if(k<=mid)
{
tr[now].lc=len+1;
update(tr[last].lc,l,mid,k);
}
else
{
tr[now].rc=len+1;
update(tr[last].rc,mid+1,r,k);
}
tr[now].val=tr[tr[now].lc].val+tr[tr[now].rc].val;
}
int query(int l,int r,int L,int R,int k)
{
if(l==r) return A[l];
int mid=l+r>>1,tt=tr[tr[R].lc].val-tr[tr[L].lc].val;
if(k<=tt) return query(l,mid,tr[L].lc,tr[R].lc,k);
else return query(mid+1,r,tr[L].rc,tr[R].rc,k-tt);
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&a[i].x),a[i].id=i,A[i]=a[i].x;
build(1,n);root[0]=1;
sort(a+1,a+1+n,cmp);sort(A+1,A+1+n);for(int i=1;i<=n;i++) b[a[i].id]=i;
for(int i=1;i<=n;i++) root[i]=len+1,update(root[i-1],1,n,b[i]);
for(int i=1;i<=m;i++)
{
int x,y,k;
scanf("%d%d%d",&x,&y,&k);
printf("%d\n",query(1,n,root[x-1],root[y],k));
}
}
线段树合并:
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; const int maxn=100010; int n,m,a[maxn]; struct tyb{int x,id;}A[maxn]; bool cmp(tyb x,tyb y){return x.x<y.x;} int val[maxn*25],lc[maxn*25],rc[maxn*25],root[maxn],cnt=0,number[maxn]; void build(int &u,int l,int r,int x) { if(!u)u=++cnt; val[u]++; if(l==r)return; int mid=(l+r)>>1; if(x<=mid)build(lc[u],l,mid,x); else build(rc[u],mid+1,r,x); } void merge(int &u1,int u2) { if(!u1){u1=u2;return;} if(!u2)return; val[u1]+=val[u2]; merge(lc[u1],lc[u2]); merge(rc[u1],rc[u2]); } int query(int r1,int r2,int l,int r,int k) { if(l==r)return number[l]; int c=val[lc[r1]]-val[lc[r2]],mid=(l+r)>>1; if(k<=c) return query(lc[r1],lc[r2],l,mid,k); else return query(rc[r1],rc[r2],mid+1,r,k-c); } void mem() { memset(lc,0,sizeof(lc)); memset(rc,0,sizeof(rc)); memset(val,0,sizeof(val)); memset(root,0,sizeof(root)); } int main() { mem(); scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) scanf("%d",&A[i].x),A[i].id=i,number[i]=A[i].x; sort(A+1,A+1+n,cmp);sort(number+1,number+1+n); for(int i=1;i<=n;i++) a[A[i].id]=i; for(int i=1;i<=n;i++) { build(root[i],1,n,a[i]); merge(root[i],root[i-1]); } while(m--) { int x,y,k; scanf("%d%d%d",&x,&y,&k); printf("%d\n",query(root[y],root[x-1],1,n,k)); } }
整体二分:
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> using namespace std; #define LL long long #define pa pair<int,int> const int Maxn=100010; const int inf=1e9; int read() { int x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar(); return x*f; } int n,Q,a[Maxn],cnt=0,ans[5010]; struct Opt{int type,id,x,y,k;}q[Maxn+5010],q1[Maxn+5010],q2[Maxn+5010]; int s[Maxn]; void add(int x,int y){for(;x<=n;x+=(x&-x))s[x]+=y;} int getsum(int x){int re=0;for(;x;x-=(x&-x))re+=s[x];return re;} void solve(int l,int r,int L,int R) { if(l>r)return; if(L==R) { for(int i=l;i<=r;i++) if(q[i].type==2)ans[q[i].id]=L; return; } int Mid=L+R>>1,l1=0,l2=0; for(int i=l;i<=r;i++) { if(q[i].type==1) { if(q[i].y<=Mid)add(q[i].x,1),q1[++l1]=q[i]; else q2[++l2]=q[i]; } else { int t=getsum(q[i].y)-getsum(q[i].x-1); if(t<q[i].k)q[i].k-=t,q2[++l2]=q[i]; else q1[++l1]=q[i]; } } for(int i=1;i<=l1;i++)if(q1[i].type==1)add(q1[i].x,-1); for(int i=1;i<=l1;i++)q[l+i-1]=q1[i]; for(int i=1;i<=l2;i++)q[l+i+l1-1]=q2[i]; solve(l,l+l1-1,L,Mid);solve(l+l1,r,Mid+1,R); } int main() { n=read(),Q=read(); for(int i=1;i<=n;i++)q[i].y=a[i]=read(),q[i].type=1,q[i].x=i; for(int i=1;i<=Q;i++) { q[i+n].x=read(),q[i+n].y=read(),q[i+n].k=read(); q[i+n].type=2;q[i+n].id=++cnt; } solve(1,n+Q,-inf,inf); for(int i=1;i<=Q;i++)printf("%d\n",ans[i]); }