1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53
| #include<bits/stdc++.h> #define Tp template<typename Ty> #define Ts template<typename Ty,typename... Ar> #define W while #define I inline #define RI register int #define LL long long #define Cn const #define CI Cn int& #define gc getchar #define D isdigit(c=gc()) #define min(x,y) ((x)<(y)?(x):(y)) #define max(x,y) ((x)>(y)?(x):(y)) using namespace std; namespace Debug{ Tp I void _debug(Cn char* f,Ty t){cerr<<f<<'='<<t<<endl;} Ts I void _debug(Cn char* f,Ty x,Ar... y){W(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);} Tp ostream& operator<<(ostream& os,Cn vector<Ty>& V){os<<"[";for(Cn auto& vv:V) os<<vv<<",";os<<"]";return os;} #define gdb(...) _debug(#__VA_ARGS__,__VA_ARGS__) }using namespace Debug; namespace FastIO{ #define FS 100000 #define tc() (FA==FB&&(FB=(FA=FI)+fread(FI,1,FS,stdin),FA==FB)?EOF:*FA++) #define pc(c) (FC==FE&&(clear(),0),*FC++=c) int OT;char oc,FI[FS],FO[FS],OS[FS],*FA=FI,*FB=FI,*FC=FO,*FE=FO+FS; I void clear(){fwrite(FO,1,FC-FO,stdout),FC=FO;} Tp I void read(Ty& x){x=0;W(!isdigit(oc=tc()));W(x=(x<<3)+(x<<1)+(oc&15),isdigit(oc=tc()));} Ts I void read(Ty& x,Ar&... y) {read(x),read(y...);} Tp I void writeln(Ty x){W(OS[++OT]=x%10+48,x/=10);W(OT) pc(OS[OT--]);pc('\n');} }using namespace FastIO; Cn int N=4e4+2,S=106,M=N/S+2; int n,m,a[N],b[N],cnt,tot,Ans,Cnt[N],F[M][M],pos[N],DP[M][M],SZ[N]; vector<int> v[N]; I void Build(){ RI i,j,k,t,now;for(sort(b,b+n),cnt=unique(b,b+n)-b,i=0;i<n;i++) a[i]=lower_bound(b,b+cnt,a[i])-b,pos[i]=SZ[a[i]]++,v[a[i]].push_back(i);tot=(n-1)/S+1; for(i=1;i<=tot;i++) for(memset(Cnt,0,sizeof(Cnt)),now=a[j=i];j<=tot;j++) for(k=(j-1)*S;k==min(j*S-1,n-1)+1&&(F[i][j]=Cnt[now],DP[i][j]=now),k<=min(j*S-1,n-1);k++) if(++Cnt[a[k]],Cnt[a[k]]>Cnt[now](Cnt[a[k]]==Cnt[now]&&a[k]<now)) now=a[k]; } I int Query(CI Ll,CI Rr){ RI i,j,l=Ll/S+1,r=Rr/S+1,now=0,zz=0;if(l==r){ for(now=0,i=Ll;i<=Rr;i++){W(pos[i]+now<SZ[a[i]]&&v[a[i]][pos[i]+now]<=Rr) zz=a[i],now++;if(pos[i]+now-1<SZ[a[i]]&&v[a[i]][pos[i]+now-1]<=Rr&&zz>a[i]) zz=a[i];} return b[zz]; }if(l+1<=r-1) now=F[l+1][r-1],zz=DP[l+1][r-1]; for(i=Ll;i<=min(l*S-1,n-1);i++){W(pos[i]+now<SZ[a[i]]&&v[a[i]][pos[i]+now]<=Rr) zz=a[i],now++;if(pos[i]+now-1<SZ[a[i]]&&v[a[i]][pos[i]+now-1]<=Rr&&zz>a[i]) zz=a[i];} for(i=(r-1)*S;i<=Rr;i++){W(pos[i]-now>=0&&v[a[i]][pos[i]-now]>=Ll) zz=a[i],now++;if(pos[i]-(now-1)>=0&&v[a[i]][pos[i]-(now-1)]>=Ll&&zz>a[i]) zz=a[i];} return b[zz]; } int main(){ RI i,l,r,p=0;for(read(n,m),i=0;i<n;i++) read(a[i]),b[i]=a[i]; for(Build();m--;) read(l,r),l=l+p-1,l>=n&&(l%=n,0),r=r+p-1,r>=n&&(r%=n,0),l>r&&(swap(l,r),0),writeln(p=Query(l,r)); return clear(),0; }
|