BZOJ3489: A simple rmq problem kdtree

题意：给出一个长度为N的序列，M个询问，每次询问[L,R]中只出现过一次的最大数，不存在输出0，强制在线
N<=100000 M<=200000
卡时神器kdtree暴力水过。
用set预处理出每个元素i前面一个和它相等的元素pre[i]和后面一个和它相等的元素nex[i]，则查询变为查询l<=pos<=r，pre < l，nex > r的元素中最大的，用三维kdtree暴力就可以了。
读入优化加上更慢是什么情况。。。

#include<cstdio>
#include<algorithm>
#include<ext/pb_ds/assoc_container.hpp>
#define gm 100005
#ifdef ONLINE_JUDGE
#define null_type null_mapped_type
#endif
using namespace __gnu_pbds;
int cmp;
struct pnt
{
    int p[3];
    int& operator [] (size_t x) {return p[x];}
    const int& operator [] (size_t x) const {return p[x];}
}p[gm];
inline void min(int& a,int b)
{
    if(b<a) a=b;
}
inline void max(int& a,int b)
{
    if(a<b) a=b;
}
struct node
{
    node *l,*r;
    pnt p,mn,mx;
    int v,sv;
    node(const pnt &p,size_t v):l(),r(),p(p),mn(p),mx(p),v(v),sv(v){}
    inline void up()
    {
        if(l)
        {
            min(mn[0],l->mn[0]),min(mn[1],l->mn[1]),min(mn[2],l->mn[2]);
            max(mx[0],l->mx[0]),max(mx[1],l->mx[1]),max(mx[2],l->mx[2]);
            max(sv,l->sv);
        }
        if(r)
        {
            min(mn[0],r->mn[0]),min(mn[1],r->mn[1]),min(mn[2],r->mn[2]);
            max(mx[0],r->mx[0]),max(mx[1],r->mx[1]),max(mx[2],r->mx[2]);
            max(sv,r->sv);
        }
    }
    static int x1,x2,y,z;
    int getmax()
    {
        if(!this) return 0;
        if(x1<=mn[0]&&mx[0]<=x2&&mx[1]<y&&mn[2]>z) return sv;
        if(mx[0]<x1||mn[0]>x2||mn[1]>=y||mx[2]<=z) return 0;
        int res=0;
        if(x1<=p[0]&&p[0]<=x2&&p[1]<y&&p[2]>z) res=v;
        max(res,l->getmax());
        max(res,r->getmax());
        return res;
    }
    inline void* operator new (size_t);
};
int node::x1,node::x2,node::y,node::z;
char pool[gm*sizeof(node)];
inline void* node::operator new(size_t)
{
    static int t=-1;
    static node* s=(node*)pool;
    return s+ ++t;
}
inline bool cmp_fn(int a,int b)
{
    return p[a][cmp]<p[b][cmp];
}
int a[gm],ar[gm];
node* build(int* l,int *r,int k)
{
    if(l==r) return 0;
    int* mid=l+(r-l>>1);
    cmp=k;
    std::nth_element(l,mid,r,cmp_fn);
    node *kre=new node(p[*mid],a[p[*mid][0]]);
    kre->l=build(l,mid,k==2?0:k+1);
    kre->r=build(mid+1,r,k==2?0:k+1);
    kre->up();
    return kre;
}
struct kdtree
{
    node *rt;
    kdtree(int* ar,int len):rt(build(ar,ar+len,0)){}
    inline int maxnum(int l,int r)
    {
        node::x1=node::y=l,node::x2=node::z=r;
        return rt->getmax();
    }
};
int n,m,last=0;
typedef std::pair<int,int> pr;
typedef tree<pr,null_type> set;
set s;
set::iterator pos[gm];
const size_t str=1<<20;
struct Istream
{
    char buf[str],*s,*t;
    Istream():buf(),s(),t(){}
    inline char get()
    {
        if(s==t) t=buf+fread(s=buf,1,str-1,stdin);
        return *s++;
    }
    inline Istream& operator >> (int &x)
    {
        register char c;
        x=0;
        do c=get(); while(c<'0'||c>'9');
        while(c>='0'&&c<='9') x=x*10+c-'0',c=get();
        return *this;
    }
}cin;
struct Ostream
{
    char buf[str],*s,*t;
    Ostream():buf(),s(buf),t(buf+str-1){}
    ~Ostream(){fwrite(buf,1,s-buf,stdout);}
    inline void put(char c)
    {
        if(s==t) fwrite(s=buf,1,str-1,stdout);
        *s++=c;
    }
    inline Ostream& operator << (const int &x)
    {
        static int a[15],t;
        if(!x) return put('0'),put('\n'),*this;
        a[t=1]=x;
        while(a[t]) a[t+1]=a[t]/10,a[t++]%=10;
        while(--t) put(a[t]+'0');
        return put('\n'),*this;
    }
}cout;
int main()
{
    cin>>n>>m;
    s.insert(pr(0,0)),s.insert(pr(n+1,n+1));
    for(int i=1;i<=n;++i)
    {
        cin>>a[i];
        pos[i]=s.insert(pr(a[i],i)).first;
        p[i][0]=ar[i]=i;
    }
    for(int i=1;i<=n;++i)
    {
        set::iterator x=pos[i],y=pos[i];
        --x,++y;
        p[i][1]=(a[i]==x->first)?x->second:0;
        p[i][2]=(a[i]==y->first)?y->second:n+1;
    }
    kdtree tr(ar+1,n);
    for(int i=1;i<=m;++i)
    {
        int x,y;
        cin>>x>>y;
        x=(x+last)%n+1,y=(y+last)%n+1;
        if(x>y){int z=x;x=y;y=z;}
        cout<<(last=tr.maxnum(x,y));
    }
    return 0;
}