P5906【模板】回滚莫队&不删除莫队

题目

题目

思路

不删除莫队，其实相比普通莫队，只多了一步：
在需要删除的时候，选择重新开始莫队
就是这样了，千万记得重开莫队要清零。
code:

#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
//When I wrote this code,God and I unterstood what was I doing 
struct f{
	int l,r,id;
	int x;
} a[500010];
int n,color[500010],c2[500010],m,k,l=1,r,len,id[500010],rk[500010];
int sum,s[500010],e[500010],ed[500010];
inline int read()
{
    int ret,c,f=1;
    while (((c=getchar())> '9'||c< '0')&&c!='-');
    if (c=='-') f=-1,ret=0;
    else ret=c-'0';
    while ((c=getchar())>='0'&&c<='9') ret=ret*10+c-'0';
    return ret*f;
}
bool cmp(f a,f b)
{
	return id[a.l]==id[b.l]?a.r<b.r:a.l<b.l;
}
bool cmp2(f a,f b)
{
	return a.id<b.id;
}
int main()
{
	n=read();
	len=sqrt(n);
	for (int i=1;i<=n;i++)
	{
		color[i]=c2[i]=read();
		id[i]=(i-1)/len+1;
	}
	for (int i=1;i<=id[n];i++) rk[i]=(i<id[n]?len*i:n);
	m=read();
	for (int i=1;i<=m;i++)
	{
		a[i].l=read(),a[i].r=read(),a[i].id=i;
	}
	sort(a+1,a+1+m,cmp);
	sort(c2+1,c2+1+n);
	int n2=unique(c2+1,c2+1+n)-c2-1;
	for (int i=1;i<=n;i++)
	{
		color[i]=lower_bound(c2+1,c2+1+n2,color[i])-c2;
	}
	l=0,r=0;
	int wj=0;
	for (int i=1;i<=m;i++)
	{
		if (id[a[i].l]==id[a[i].r])
		{
			sum=0;
			for (int j=a[i].l;j<=a[i].r;j++) s[color[j]]=0;
			for (int j=a[i].l;j<=a[i].r;j++)
			{
				if (s[color[j]]==0)
				{
					s[color[j]]=j;
				}
				sum=max(sum,j-s[color[j]]);
			}
			a[i].x=sum;
			for (int j=a[i].l;j<=a[i].r;j++) s[color[j]]=0;
			continue;
		}
		if (wj!=id[a[i].l])
		{
			sum=0;
			for (int j=l;j<=r;j++) s[color[j]]=e[color[j]]=0;
			l=rk[id[a[i].l]];
			r=l-1;
			wj=id[a[i].l];
		}
		while (r<a[i].r)
		{
			r++;
			if (s[color[r]]==0) s[color[r]]=r;
			e[color[r]]=r;
			sum=max(sum,r-s[color[r]]);
		}
		a[i].x=sum;
		int kyx=l;
		while (a[i].l<kyx)
		{
			kyx--;
			if (ed[color[kyx]]==0) ed[color[kyx]]=kyx;
			a[i].x=max(a[i].x,max(ed[color[kyx]],e[color[kyx]])-kyx);
		}
		while (l>kyx)
		{
			ed[color[kyx]]=0;
			kyx++;
		}
	}
	sort(a+1,a+1+m,cmp2);
	for (int i=1;i<=m;i++)
	{
		printf("%d\n",a[i].x);
	}
	return 0; 
}
//Now,only God know