Codeforces 220B Little Elephant and Array（莫队）

传送门

题意：给一个长度为n的数列，m次询问，第i次询问到区间内有多少个数的出现次数等于它自己。n, m<=1e5

题解：由于询问可以离线，所以用莫队。注意要先离散化，否则再开个map复杂度会多一个log，会TLE。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;
const int N=1e5+4;
int n,m;
int a[N],bel[N],siz;
int b[N],c[N];
struct Query {
	int l,r,id;
	friend bool operator<(const Query &a,const Query &b) {
		return bel[a.l]<bel[b.l]||(bel[a.l]==bel[b.l]&&a.r<b.r);
	}
}q[N];
set<int> s;
int ans[N];
int cnt[N];
int cur;
inline int read() {
	int x=0,f=1;char c=getchar();
	while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
	while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*f;
}
inline void modify(int p,int d) {
	if (cnt[a[p]]==c[p]) --cur;
	cnt[a[p]]+=d;
	if (cnt[a[p]]==c[p]) ++cur;
}
int main() {
//	freopen("in.txt","r",stdin);
	n=read(),m=read();
	siz=(int)sqrt((double)n);
	for (register int i=1;i<=n;++i) {
		c[i]=b[i]=a[i]=read();
		bel[i]=i/siz;
	}
	sort(b+1,b+n+1);
	int nn=unique(b+1,b+n+1)-b-1;
	for (register int i=1;i<=n;++i) {
		a[i]=lower_bound(b+1,b+nn+1,a[i])-b;
	}
	for (register int i=1;i<=m;++i) {
		q[i].l=read();
		q[i].r=read();
		q[i].id=i;
	}
	sort(q+1,q+m+1);
	int l=1,r=0;
	for (register int i=1;i<=m;++i) {
		int ql=q[i].l,qr=q[i].r;
		while (r<qr) modify(++r,1);
		while (r>qr) modify(r--,-1);
		while (l>ql) modify(--l,1);
		while (l<ql) modify(l++,-1);
		ans[q[i].id]=cur;
	}
	for (register int i=1;i<=m;++i)
		printf("%d\n",ans[i]);
	return 0;
}