主席树
当时疯狂在想树套树+分块,自闭一下午
结果一个正常的主席树就切掉了
我太难了~
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <map>
#include <algorithm>
#define lch a[n].lc
#define rch a[n].rc
using namespace std;
const int maxn=5e5+10;
int n,m,aa[maxn],v[maxn],linum,to[maxn],root[maxn],topt,lim;
struct da{int lc,rc,si;}a[20*maxn];
map<int,int>lc;
inline int read()
{
int xx=0,ff=1; char c=getchar();
while (c<'0' || c>'9') {if (c=='-') ff=-1; c=getchar();}
while (c>='0' && c<='9') {xx=(xx<<1)+(xx<<3)+c-'0'; c=getchar();}
return xx*ff;
}
void build_tree(int &n,int l,int r)
{
n=++topt; a[n].si=0;
if (l==r) return;
int mid=(l+r)>>1;
build_tree(lch,l,mid); build_tree(rch,mid+1,r);
}
inline void updata(int n){a[n].si=a[lch].si+a[rch].si;}
void tree_add(int old,int &n,int l,int r,int lc)
{
if (!n) n=++topt;
if (l==r) {a[n].si=a[old].si+1; return;}
int mid=(l+r)>>1;
if (lc<=mid) {a[n].rc=a[old].rc; tree_add(a[old].lc,lch,l,mid,lc);}
else {a[n].lc=a[old].lc; tree_add(a[old].rc,rch,mid+1,r,lc);}
updata(n);
}
int qury(int old,int n,int l,int r)
{
if (l==r) return to[l];
int mid=(l+r)>>1,suml=0,sumr=0;
suml=a[lch].si-a[a[old].lc].si; sumr=a[rch].si-a[a[old].rc].si;
if (suml>=lim) return qury(a[old].lc,lch,l,mid);
else if (sumr>=lim) return qury(a[old].rc,rch,mid+1,r);
return 0;
}
int main()
{
n=read(); m=read();
for (int i=1;i<=n;++i) aa[i]=read(),v[i]=aa[i];
sort(v+1,v+n+1);
for (int i=1;i<=n;i++) if (!lc.count(v[i])) lc[v[i]]=++linum,to[linum]=v[i];
for (int i=1;i<=n;i++) aa[i]=lc[aa[i]];
build_tree(root[0],1,linum);
for (int i=1;i<=n;i++) tree_add(root[i-1],root[i],1,linum,aa[i]);
for (int i=1;i<=m;i++)
{
int ll,rr; scanf("%d%d",&ll,&rr); lim=((rr-ll+1)/2)+1;
printf("%d\n",qury(root[ll-1],root[rr],1,linum));
}
return 0;
}