2724: [Violet 6]蒲公英
Time Limit: 40 Sec Memory Limit: 512 MB
Description
Input
Output
Sample Input
6 3
1 2 3 2 1 2
1 5
3 6
1 5
Sample Output
1
2
1
HINT
思路:
经典分块题目,先维护好块中信息,其他的暴力去算就可以了。
#include <map>
#include <cmath>
#include <cstdio>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#define inf 0x7fffffff
#define LL long long
using namespace std;
const int N = 50010;
int n, m, block, idc=0;
int f[510][510], val[N], cnt[N], v[N], pos[N];
vector <int> num[N];
map <int,int> mp;
void pre(int x){
memset(cnt, 0, sizeof(cnt));
int mx=0, ans=0;
for(int i=(x-1)*block+1; i<=n; i++){
cnt[v[i]]++;
int t = pos[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;//块x~t中的众数
}
}
int query(int l, int r, int x){
int t = upper_bound(num[x].begin(),num[x].end(),r) - lower_bound(num[x].begin(),num[x].end(),l);
//l~r中相同数的个数
return t;
}
int query(int a, int b){
int ans, mx;
ans = f[pos[a]+1][pos[b]-1];//块内信息
mx = query(a, b, ans);//当前众数的个数
for(int i=a; i<=min(pos[a]*block,b); i++){//块前散点
int t = query(a, b, v[i]);//当前数个数
if(t>mx || (t==mx && val[v[i]]<val[ans])) ans = v[i], mx = t;
}
if(pos[a] != pos[b])
for(int i=(pos[b]-1)*block+1; i<=b; i++){//块后散点
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);
block = (int) sqrt( n );
int ans = 0;
for(int i=1; i<=n; i++){
scanf("%d", &v[i]);
if( !mp[v[i]] ){//离散化
mp[v[i]] = ++idc;
val[idc] = v[i];
}
v[i] = mp[v[i]];
num[v[i]].push_back(i);//相同数的位置
}
for(int i=1; i<=n; i++)
pos[i] = (i-1) / block + 1;//分块
for(int i=1; i<=pos[n]; i++) pre( i );//预处理
for(int i=1; i<=m; i++){
int a, b;
scanf("%d%d", &a, &b);
a = (a + ans - 1) % n + 1;
b = (b + ans - 1) % n + 1;
if(a > b) swap(a, b);
ans = val[query(a, b)];
printf("%d\n", ans);
}
return 0;
}