cf-220B 莫队 //对询问分块

http://codeforces.com/problemset/problem/220/B

155ms

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
typedef long long ll;
int cnt[N],n,m,id;
int pos[N],L=1,R,res,ans[N],block;
struct Block{
	int l,r,id;
	bool operator<(const Block& t)const{
		return pos[l]==pos[t.l]?r<t.r:pos[l]<pos[t.l];
	}
}q[N];
//unordered_map<int,int>cnt; 1045ms
int a[N],b[N],c[N];//离散化
void discrete(){
	sort(b+1,b+n+1);
	int ct=unique(b+1,b+n+1)-b-1;
	for(int i=1;i<=n;++i)a[i]=lower_bound(b+1,b+ct+1,a[i])-b;
}
inline void add(int x){
	id=a[x];
	++cnt[id];
	if(cnt[id]==c[x])++res;
	else if(cnt[id]==c[x]+1)--res;
}
inline void del(int x){
	id=a[x];
	if(cnt[id]==c[x])--res;
	else if(cnt[id]==c[x]+1)++res;
	--cnt[id];
}
int main(){
	scanf("%d%d",&n,&m);
	block=sqrt(n);
	for(int i=1;i<=n;++i)scanf("%d",&a[i]),pos[i]=i/block,c[i]=b[i]=a[i];
	for(int i=1;i<=m;++i)scanf("%d%d",&q[i].l,&q[i].r),q[i].id=i;
	sort(q+1,q+m+1);
	discrete();
	for(int i=1;i<=m;++i){
		while(L>q[i].l)add(--L);
		while(R<q[i].r)add(++R);
		while(L<q[i].l)del(L++);
		while(R>q[i].r)del(R--);
		ans[q[i].id]=res;
	}
	for(int i=1;i<=m;++i)printf("%d\n",ans[i]);
	return 0;
}