题意:
给出一个长度为n的序列,m次询问l,r,每次输出区间的中间值
题解:
裸的划分树/主席树,又水了一篇题解真快乐
AC代码(主席树):
#pragma GCC optimize(2)
#include<bits/stdc++.h>
#include<ext/rope>
using namespace std;
using namespace __gnu_cxx;
typedef long long LL;
const int MAXN = 1e5+50;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
int rt[MAXN],a[MAXN],id[MAXN],tot;
struct node{ int l,r,sum; }t[MAXN*20];
vector<int> v;
inline void Init(){
tot=0; v.clear(); memset(t,0,sizeof(t));
memset(rt,0,sizeof(rt));
}
inline void update(int l,int r,int &x,int y,int k){
t[++tot]=t[y],t[tot].sum++,x=tot;
if(l==r) return;
int mid=(l+r)>>1;
if(mid>=k) update(l,mid,t[x].l,t[y].l,k);
else update(mid+1,r,t[x].r,t[y].r,k);
}
inline int query(int l,int r,int x,int y,int k){
if(l==r) return l;
int mid=(l+r)>>1;
int sum=t[t[y].l].sum-t[t[x].l].sum;
if(sum>=k) return query(l,mid,t[x].l,t[y].l,k);
else return query(mid+1,r,t[x].r,t[y].r,k-sum);
}
inline int Id(int x) { return lower_bound(v.begin(),v.end(),x)-v.begin()+1; }
int main(){
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
#endif // ONLINE_JUDGE
int n,Q,cas=0;
while(~scanf("%d",&n)){
Init();
for(int i=1;i<=n;i++) scanf("%d",&a[i]),v.push_back(a[i]);
sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
int sz = v.size();
for(int i=1;i<=n;i++) update(1,sz,rt[i],rt[i-1],Id(a[i]));
scanf("%d",&Q);
printf("Case %d:\n",++cas);
while(Q--){
int l,r; scanf("%d%d",&l,&r);
printf("%d\n",v[query(1,sz,rt[l-1],rt[r],(r-l)/2+1)-1]);
}
}
return 0;
}
AC代码(划分树)
#pragma GCC optimize(2)
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
using namespace __gnu_cxx;
typedef long long LL;
const int MAXN = 1e5+10;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
int a[MAXN],sorted[MAXN],num[20][MAXN],val[20][MAXN];
inline void build(int l,int r,int dep){
if(l==r) return;
int mid=(l+r)>>1,same=mid-l+1;
for(int i=l;i<=r;i++) if(val[dep][i]<sorted[mid]) same--;
int ln=l,rn=mid+1;
for(int i=l;i<=r;i++){
num[dep][i]=(i==l ? 0:num[dep][i-1]);
if(val[dep][i]<sorted[mid] || (val[dep][i]==sorted[mid]&&same>0)){
val[dep+1][ln++]=val[dep][i]; num[dep][i]++;
if(val[dep][i]==sorted[mid]) same--;
}else val[dep+1][rn++]=val[dep][i];
}
build(l,mid,dep+1); build(mid+1,r,dep+1);
}
inline int query(int dep,int l,int r,int ql,int qr,int k){
if(l==r) return val[dep][l];
int ll=(ql==l ? 0:num[dep][ql-1]);
int tot=num[dep][qr]-ll,mid=(l+r)>>1;
if(tot>=k) return query(dep+1,l,mid,l+ll,l+num[dep][qr]-1,k);
else{
int lr=mid+1+(ql-l-ll);
return query(dep+1,mid+1,r,lr,lr+qr-ql+1-tot-1,k-tot);
}
}
signed main(){
#ifndef ONLINE_JUDGE
freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
#endif // ONLINE_JUDGE
int n,m,l,r,k,cas=0;
while(~scanf("%d",&n)){
for(int i=1;i<=n;i++) scanf("%d",&val[0][i]),sorted[i]=val[0][i];
sort(sorted+1,sorted+n+1);
build(1,n,0);
scanf("%d",&m);
printf("Case %d:\n",++cas);
while(m--){
scanf("%d%d",&l,&r);
printf("%d\n",query(0,1,n,l,r,(r-l+1+1)>>1));
}
}
return 0;
}