[BZOJ2724] 分块

[BZOJ2724]

• 求区间众数
• 分块+预处理

Code

---

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
const int N=5e4+10;
int x,y,n,m,ans=0,id=0,blo,v[N],cnt[N],val[N],bl[N],f[505][505];
map<int,int> mp;
vector<int> ve[N];
void work(int x){
	memset(cnt,0,sizeof(cnt));
	int mx=0,ans=0;
	rep(i,(x-1)*blo+1,n){
		cnt[v[i]]++;
		int t=bl[i];
		if(cnt[v[i]]>mx||(cnt[v[i]]==mx&&val[v[i]]<val[ans]))
		ans=v[i],mx=cnt[v[i]];
		f[x][t]=ans;
	}
}
int query(int l,int r,int x){
	int t=upper_bound(ve[x].begin(),ve[x].end(),r)-lower_bound(ve[x].begin(),ve[x].end(),l);
	return t;
}
int query(int a,int b){
	int mx=0,ans=0;
	ans=f[bl[a]+1][bl[b]-1];
	mx=query(a,b,ans);
	rep(i,a,min(b,bl[a]*blo)){
		int t=query(a,b,v[i]);
		if(t>mx||(t==mx&&val[v[i]]<val[ans]))
		ans=v[i],mx=t;
	}
	if(bl[a]==bl[b])return ans;
	rep(i,(bl[b]-1)*blo+1,b){
		int t=query(a,b,v[i]);
		if(t>mx||(t==mx&&val[v[i]]<val[ans]))
		ans=v[i],mx=t;
	}return ans;
}
int main()
{
	scanf("%d%d",&n,&m); blo=170;
	rep(i,1,n){
		scanf("%d",&v[i]);
		if(!mp[v[i]]){
			mp[v[i]]=++id;
			val[id]=v[i];
		}
		v[i]=mp[v[i]];
		ve[v[i]].push_back(i);
	}
	rep(i,1,n)bl[i]=(i-1)/blo+1;
	rep(i,1,bl[n])work(i);
	rep(i,1,m){
		scanf("%d%d",&x,&y);
		x=(x+ans-1)%n+1;y=(y+ans-1)%n+1;
		if(x>y) swap(x,y);
		ans=val[query(x,y)];
		printf("%d\n",ans);
	}return 0;
}