P3901 数列找不同(莫队)

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+5;
typedef int LL;
LL pos[maxn];
LL a[maxn];
LL cnt[maxn];
LL ans[maxn];
LL sum=0;
inline LL read()
{
	LL x=0,f=1;char ch=getchar();
	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
	return x*f;
}
struct Query{
    LL L,R,id;
}q[maxn];
bool cmp(Query A,Query B){
    if(pos[A.L]!=pos[B.L]){
        return pos[A.L]<pos[B.L];
    }
    if(pos[A.L]&1) return A.R>B.R;
    return A.R<B.R;
}
LL del(LL pos){
    cnt[a[pos]]--;
    if(cnt[a[pos]]==0) sum--;
}
LL add(LL pos){
    cnt[a[pos]]++;
    if(cnt[a[pos]]==1) sum++;
}
int main(void)
{
  ///cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,m;n=read();m=read();
  LL block=sqrt(n);
  for(LL i=1;i<=n;i++){
    a[i]=read();
    pos[i]=(i-1)/block+1;
  }
  for(LL i=1;i<=m;i++){
      q[i].L=read();q[i].R=read();
      q[i].id=i;
  }
  sort(q+1,q+1+m,cmp);
  LL L=1;LL R=0;
  for(LL i=1;i<=m;i++){
    while(L<q[i].L) del(L),L++;
    while(R>q[i].R) del(R),R--;
    while(L>q[i].L) add(--L);
    while(R<q[i].R) add(++R);
    if(sum==q[i].R-q[i].L+1) ans[q[i].id]=1;
    else ans[q[i].id]=0;
  }
  for(LL i=1;i<=m;i++){
    if(ans[i]) printf("Yes\n");
    else printf("No\n");
  }
return 0;
}