[bzoj3489]A simple rmq problem

 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<algorithm>
 5 using namespace std;
 6 const int maxn=100233;
 7 struct poi{
 8     int pos,pr,af,num;
 9 }a[maxn];
10 int pr[maxn],af[maxn];
11 int rt_out[maxn],rt[maxn*18],lc[maxn*18],rc[maxn*18],tt;
12 int mx[400*maxn],l[400*maxn],r[400*maxn],tot;
13 int i,j,n,m,L,R,lastans,v,v1;
14 
15 int ra;char rx;
16 inline int read(){
17     rx=getchar(),ra=0;
18     while(rx<‘0‘||rx>‘9‘)rx=getchar();
19     while(rx>=‘0‘&&rx<=‘9‘)ra*=10,ra+=rx-48,rx=getchar();return ra;
20 }
21 char qaq[7];int len;
22 inline void outx(int x){
23     if(!x){puts("0");return;}
24     while(x)qaq[len++]=x%10,x/=10;
25     while(len)putchar(qaq[--len]+‘0‘);putchar(‘\n‘);
26 }
27 inline int max(int x,int y){return x<y?y:x;}
28 
29 
30 inline void ins(int pre,int &x,int L,int R){
31     x=++tot,mx[x]=mx[pre];
32     if(a[i].num>mx[x])mx[x]=a[i].num;
33     if(L==R)return;
34     register int mid=(L+R)>>1;
35     if(v<=mid)r[x]=r[pre],ins(l[pre],l[x],L,mid);
36     else l[x]=l[pre],ins(r[pre],r[x],mid+1,R);
37 }
38 int zs;
39 inline int getmx(int x,int L,int R,int c,int d){
40     if(!x)return 0;
41     if(c<=L&&d>=R)return mx[x];register int mid=(L+R)>>1;
42     if(c>mid)return getmx(r[x],mid+1,R,c,d);else
43     if(d<=mid)return getmx(l[x],L,mid,c,d);else
44     return max(getmx(l[x],L,mid,c,d),getmx(r[x],mid+1,R,c,d));
45     
46 }
47 
48 
49 
50 
51 inline void insert(int pre,int&x,int L,int R){
52     x=++tt,ins(rt[pre],rt[x],1,n);
53     if(L==R)return;
54     register int mid=(L+R)>>1;
55     if(v1<=mid)rc[x]=rc[pre],insert(lc[pre],lc[x],L,mid);
56     else lc[x]=lc[pre],insert(rc[pre],rc[x],mid+1,R);
57 }
58 inline int query(int x,int l,int r,int c,int d){
59     if(!x)return 0;
60     if(c<=l&&d>=r)return getmx(rt[x],1,n,L,R);
61     register int mid=(l+r)>>1;
62     if(c>mid)return query(rc[x],mid+1,r,c,d);
63     else return max(getmx(rt[rc[x]],1,n,L,R),query(lc[x],l,mid,c,d));
64 }
65 
66 
67 
68 
69 bool cmp(poi a,poi b){return a.pr<b.pr;}
70 int main(){
71     n=read(),m=read();
72     for(i=1;i<=n;i++)a[i].pos=i,a[i].pr=pr[a[i].num=read()],pr[a[i].num]=i;
73     for(i=n;i;i--)a[i].af=af[a[i].num]?af[a[i].num]:(n+1),af[a[i].num]=i;
74     sort(a+1,a+1+n,cmp);
75     for(i=1;i<=n;i++)v=a[i].pos,v1=a[i].af,insert(rt_out[i-1],rt_out[i],1,n+1);
76     for(i=1;i<=m;i++){
77         L=read()+lastans,R=read()+lastans;
78         if(L>=n)L%=n;if(R>=n)R%=n;
79         L++,R++;if(L>R)swap(L,R);
80         register int l=1,r=n,mid;
81         for(;l<r;a[mid].pr<L?(l=mid):(r=mid-1)) mid=(l+r+1)>>1;
82         lastans=query(rt_out[l],1,n+1,R+1,n+1);
83         outx(lastans);
84     }
85     return 0;
86 }