写过上一篇的那两道题,这个题还算个鬼啊QAQ
我们把n个数建立可持久化线段树后对于每个询问区间,我们向他区间元素个数大于(R-L+1)/2的子区间继续查询,知道最后区间大小为1或者区间元素个数小于(R-L+1)/2
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=600000+10;
const int maxs=10001000;
int n,m,T[maxn],tot=1;
int c[maxs],lson[maxs],rson[maxs];
int update(int root,int pos,int v){
if (!root) root=tot++,c[root]=0;
int nr=tot++,tmp=nr;
c[nr]=c[root]+v; int l=1,r=n;
while (l<r){
int mid=(l+r)>>1;
if (pos<=mid){
lson[nr]=tot++; rson[nr]=rson[root];
r=mid; root=lson[root]; nr=lson[nr];
}else if (pos>mid){
lson[nr]=lson[root]; rson[nr]=tot++;
l=mid+1; root=rson[root]; nr=rson[nr];
}c[nr]=c[root]+v;
}return tmp;
}
int query(int lr,int rr,int l,int r,int x,int y){
if (l==r) return l;
int tmp=(y-x+1)>>1;
if (c[rr]-c[lr]<=tmp) return 0;
int mid=(l+r)>>1;
if (c[lson[rr]]-c[lson[lr]]>tmp){
int ret=query(lson[lr],lson[rr],l,mid,x,y);
if (ret) return ret;
}if (c[rson[rr]]-c[rson[lr]]>tmp){
int ret=query(rson[lr],rson[rr],mid+1,r,x,y);
if (ret) return ret;
}return 0;
}
int main(){
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i){
int x; scanf("%d",&x);
T[i]=update(T[i-1],x,1);
}
for (int i=1;i<=m;++i){
int x,y; scanf("%d%d",&x,&y);
printf("%d\n",query(T[x-1],T[y],1,n,x,y));
}
}