给定一个序列,两种操作
1.对l,r区间内的数循环移位
2.求l,r区间内有多少个k。
如qyjs巨佬所言,你分块+vector暴力不就好了!vector大法好呀!orz然后就过了orz 不过你可能需要优越的分块大小,比如sqrt(n)*log(n)
应该手写一个循环双端队列会更比较资瓷吧?
#include<cmath>
#include<vector>
#include<cstdio>
#include<algorithm>
#define N 100010
using namespace std;
inline char gc(){
static char now[1<<16],*S,*T;
if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
return *S++;
}
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9') {if (ch=='-') f=-1;ch=gc();}
while(ch<='9'&&ch>='0') x=x*10+ch-'0',ch=gc();
return x*f;
}
int n,s[350][N],ans,left[350],right[350],a[N],b[N],nn,m;
vector<int> block[350];
inline void change(int l,int r){
// printf("%d %d\n",l,r);
int v=*(block[b[l]].end()-1),pre=v;
int v1=block[b[r]][r-left[b[r]]];
if (b[l]==b[r]){
block[b[l]].erase(block[b[r]].begin()+r-left[b[r]]);
block[b[l]].insert(block[b[l]].begin()+l-left[b[l]],v1);
return;
}
--s[b[l]][v];++s[b[l]][v1];
//vector<int>:: iterator it=block[b[l]].end();
block[b[l]].erase(block[b[l]].end()-1);
block[b[l]].insert(block[b[l]].begin()+l-left[b[l]],v1);
for (int i=b[l]+1;i<=b[r]-1;++i){
--s[i][*(block[i].end()-1)];++s[i][pre];int pp=block[i][block[i].size()-1];
block[i].erase(block[i].end()-1);
block[i].insert(block[i].begin(),pre);pre=pp;
}
--s[b[r]][v1];++s[b[r]][pre];
block[b[r]].erase(block[b[r]].begin()+r-left[b[r]]);
block[b[r]].insert(block[b[r]].begin(),pre);
/* for (int i=1;i<=n/nn+1;++i)
for (int j=0;j<block[i].size();++j) printf("%d ",block[i][j]);puts("");*/
/*
for (int i=1;i<=n/nn+1;++i){
for (int j=1;j<=n;++j) printf("%d:%d\n",j,s[i][j]);
}*/
}
inline int query(int l,int r,int k){
int tmp=0;
if (b[l]==b[r]) {for (int i=l;i<=r;++i) tmp+=(block[b[l]][i-left[b[l]]]==k);return tmp;}
for (int i=l;i<=right[b[l]];++i) tmp+=(block[b[l]][i-left[b[l]]]==k);
for (int i=left[b[r]];i<=r;++i) tmp+=(block[b[r]][i-left[b[r]]]==k);
for (int i=b[l]+1;i<=b[r]-1;++i) tmp+=s[i][k];return tmp;
}
int main(){
// freopen("cf455d.in","r",stdin);
// freopen("cf.out","w",stdout);
n=read();nn=pow(n,0.618);
for (int i=1;i<=n/nn+1;++i) left[i]=(i-1)*nn+1,right[i]=i*nn; left[n/nn+1]=(n/nn)*nn+1;right[n/nn+1]=n;
// for (int i=1;i<=n/nn+1;++i) printf("%d %d\n",left[i],right[i]);
for (int i=1;i<=n;++i){
a[i]=read();b[i]=(i-1)/nn+1;++s[b[i]][a[i]];block[b[i]].push_back(a[i]);
}m=read();
//
while(m--){
int op=read(),l1=(read()+ans-1)%n+1,r1=(read()+ans-1)%n+1,k;
if(l1>r1) swap(l1,r1);
if (op==1) change(l1,r1);
if (op==2) k=(read()+ans-1)%n+1,printf("%d\n",ans=query(l1,r1,k));
}
return 0;
}