洛谷 P4137 Rmq Problem / mex

洛谷加强数据以后，无论是怎样改变块的大小或是用奇偶块排序，都不能过。

所以这里介绍一下值域分块。

在这里我们可以直接利用奇偶块排序时分的块。

在add或del改变cnt值的同时，改变相应块的权值即可。

最后的查询就能变为sqrt(n)。

#include <bits/stdc++.h>
using namespace std;
const int N=2e5+5,M=500;
int n,m,t,nowl,nowr,block;
int a[N],b[N],cnt[N],ans[N],id[N],l[N],r[N],c[N];
int size[M];
struct number{int x,y,id,bl;}num[N];

inline bool cmp(number a,number b)
{
    if (a.bl==b.bl)
    {
        if(a.bl%2==1) return a.y<b.y;
        else return a.y>b.y;
    }
    else return a.x<b.x;
}

inline void change(int x,int v)
{
	c[x]+=v; size[id[x]]+=v;
}
inline void add(int x)
{
	cnt[a[x]]++;
	if (cnt[a[x]]==1) change(a[x],1);
}
inline void del(int x)
{
	cnt[a[x]]--;
	if (!cnt[a[x]]) change(a[x],-1);
}

inline int query()
{
	if (!c[0]) return 0;
	int now=1;
	while (now<=block && size[now]==r[now]-l[now]+1) now++;
	if (now>block) return 200001;
	for (register int i=l[now]; i<=r[now]; ++i) if (!c[i]) return i;
}

int main(){
	scanf("%d%d",&n,&m);
	for (register int i=1; i<=n; ++i) scanf("%d",&a[i]),a[i]=min(a[i],200000);
	for (register int i=1; i<=m; ++i) scanf("%d%d",&num[i].x,&num[i].y),num[i].id=i;
	
	t=(int)sqrt(n);
	block=n/t;
	for (register int i=1; i<=block; ++i)
	{
		l[i]=(i-1)*t+1; r[i]=i*t;
		for (register int j=l[i]; j<=r[i]; ++j) id[j]=i;
	}
	if (block*t!=n)
	{
		block++;
		l[block]=(block-1)*t+1; r[block]=n;
		for (register int i=l[block]; i<=r[block]; ++i) id[i]=block;	
	}
	for (register int i=1; i<=m; ++i) num[i].bl=id[num[i].x];
	
	sort(num+1,num+m+1,cmp);
	nowl=num[1].x; nowr=num[1].y;
	for (register int i=nowl; i<=nowr; ++i) add(i);
	ans[num[1].id]=query();
	for (register int i=2; i<=m; ++i)
	{
		while (nowl<num[i].x) del(nowl),nowl++;
		while (nowl>num[i].x) nowl--,add(nowl);
		while (nowr<num[i].y) nowr++,add(nowr);
		while (nowr>num[i].y) del(nowr),nowr--;
		ans[num[i].id]=query();
	}
	for (register int i=1; i<=m; ++i) printf("%d\n",ans[i]);
return 0;	
}