BZOJ 2724: [Violet 6]蒲公英 分块 STL

2724: [Violet 6]蒲公英

Time Limit: 40 Sec  Memory Limit: 512 MB
Submit: 1964  Solved: 705
[Submit][Status][Discuss]

Description

Input

修正一下

l = (l_0 + x - 1) mod n + 1, r = (r_0 + x - 1) mod n + 1

Output

Sample Input

6 3
1 2 3 2 1 2
1 5
3 6
1 5

Sample Output

1
2
1

HINT

修正下：

n <= 40000, m <= 50000

千古神犇传送门

本蒟蒻用的是论文中最low最低端的做法

但我还是觉得很高端啊啊啊啊Ｔ＿Ｔ

#include<ctime>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<complex>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>                                                          
#include<queue>
#include<map>
#include<set>
using namespace std;
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
const int M=510;
const int N=50100;
int n,block,a[N],id[N],bl[N],num[N],c[M][M];
map<int,int>mp;
vector<int>v[N];
inline void initial(int x)
{
	memset(num,0,sizeof(num));int maxn=0;
	for(int i=(x-1)*block+1;i<=n;i++)
	{
		num[a[i]]++;
		if(num[a[i]]>num[maxn]||(num[a[i]]==num[maxn]&&id[a[i]]<id[maxn]))maxn=a[i];
		c[x][bl[i]]=maxn;
	}
}
inline int getnum(int x,int l,int r)
{return upper_bound(v[x].begin(),v[x].end(),r)-lower_bound(v[x].begin(),v[x].end(),l);}
inline int query(int l,int r)
{
	int d=bl[l],b=bl[r],ans=0,maxn=0;
	if(d==b)
	{
		for(int i=l;i<=r;i++)
		{
			int tmp=getnum(a[i],l,r);
			if(tmp>maxn||(id[a[i]]<id[ans]&maxn==tmp))ans=a[i],maxn=tmp;
		}
	}
	else 
	{
		ans=c[d+1][b-1],maxn=getnum(ans,l,r);
		for(int i=l;i<=block*d&&i<=n;i++)
		{
			int tmp=getnum(a[i],l,r);
			if(tmp>maxn||(tmp==maxn&&id[a[i]]<id[ans]))ans=a[i],maxn=tmp;
		}
		for(int i=block*(b-1)+1;i<=r;i++)
		{
			int tmp=getnum(a[i],l,r);
			if(tmp>maxn||(tmp==maxn&&id[a[i]]<id[ans]))ans=a[i],maxn=tmp;
		}
	}
	return ans;
}
int main()
{
	n=read();int m=read(),cnt=0,x;
	for(int i=1;i<=n;i++)
	{x=read();if(!mp[x])mp[x]=++cnt,id[cnt]=x;a[i]=mp[x];v[a[i]].push_back(i);}
	block=sqrt(n);
	for(int i=1;i<=n;i++)bl[i]=(i-1)/block+1;
	for(int i=1;i<=bl[n];i++)initial(i);
	int ans=0;
	while(m--)
	{
		int l=read(),r=read();
		l=(l+ans-1)%n+1;r=(r+ans-1)%n+1;
		if(l>r)swap(l,r);
		ans=id[query(l,r)];
		printf("%d\n",ans);
	}
	return 0;
}
/*
6 3
1 2 3 2 1 2 
1 5 
3 6 
1 5 

1 
2 
1
*/