The Little Elephant loves playing with arrays. He has array a, consisting of n positive integers, indexed from 1 to n. Let's denote the number with index i as ai.
Additionally the Little Elephant has m queries to the array, each query is characterised by a pair of integers lj and rj (1 ≤ lj ≤ rj ≤ n). For each query lj, rj the Little Elephant has to count, how many numbers x exist, such that number x occurs exactly x times among numbers alj, alj + 1, ..., arj.
Help the Little Elephant to count the answers to all queries.
The first line contains two space-separated integers n and m (1 ≤ n, m ≤ 105) — the size of array a and the number of queries to it. The next line contains n space-separated positive integers a1, a2, ..., an (1 ≤ ai ≤ 109). Next m lines contain descriptions of queries, one per line. The j-th of these lines contains the description of the j-th query as two space-separated integers lj and rj (1 ≤ lj ≤ rj ≤ n).
In m lines print m integers — the answers to the queries. The j-th line should contain the answer to the j-th query.
7 2 3 1 2 2 3 3 7 1 7 3 4
3 1
可以发现1+2+……450>10^5。所以有效的数字肯定不超过450个,只要预处理找到这些数字,然后对于每一次查询枚举这些数字就可以了。
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
using namespace std;
int n,m,i,j,k,a[100005],b[100005],c[100005];
int d[505][100005],s[100005],L,R;
int main()
{
scanf("%d%d",&n,&m);
for(i=1; i<=n; i++)
{
scanf("%d",&a[i]);
if(a[i]<=n&&(++b[a[i]]==a[i]))
c[a[i]]=1;
}//筛选出整个区间上数值为a的数的个数大于等于a的数
int t=0;
for(i=1; i<=n; i++)
{
if(c[i]==0) continue;
for(j=1; j<=n; j++)
if(a[j]==i)
d[t][j]=d[t][j-1]+1;
else
d[t][j]=d[t][j-1];
s[t++]=i;
}//求出t在0~j区间上个个数,用d[t][j]表示,另外对数据进行离散化。
while(m--)
{
int ans=0;
scanf("%d%d",&L,&R);
for(i=0; i<t; i++)
{
if(d[i][R]-d[i][L-1]==s[i])
ans++;
}
cout<<ans<<endl;
}
return 0;
}
线段树(没太看懂)
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
#define LL(x) (x<<1)
#define RR(x) (x<<1|1)
const int N=1e5+5;
struct Query
{
int st,ed,id;
Query(){}
Query(int a,int b,int c){st=a;ed=b;id=c;}
bool operator < (const Query &b)const
{
return ed<b.ed;
}
};
struct node
{
int lft,rht,sum;
int mid(){return lft+(rht-lft)/2;}
};
struct Segtree
{
node tree[N*4];
void build(int lft,int rht,int ind)
{
tree[ind].lft=lft; tree[ind].rht=rht;
tree[ind].sum=0;
if(lft!=rht)
{
int mid=tree[ind].mid();
build(lft,mid,LL(ind));
build(mid+1,rht,RR(ind));
}
}
void updata(int pos,int ind,int valu)
{
tree[ind].sum+=valu;
if(tree[ind].lft==tree[ind].rht) return;
else
{
int mid=tree[ind].mid();
if(pos<=mid) updata(pos,LL(ind),valu);
else updata(pos,RR(ind),valu);
}
}
int query(int be,int end,int ind)
{
int lft=tree[ind].lft,rht=tree[ind].rht;
if(be<=lft&&rht<=end) return tree[ind].sum;
else
{
int mid=tree[ind].mid();
int sum1=0,sum2=0;
if(be<=mid) sum1=query(be,end,LL(ind));
if(end>mid) sum2=query(be,end,RR(ind));
return sum1+sum2;
}
}
}seg;
vector<int> pos[N];
vector<Query> query;
int data[N],cnt[N],res[N];
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++) scanf("%d",&data[i]);
for(int i=0;i<m;i++)
{
int a,b;
scanf("%d%d",&a,&b);
query.push_back(Query(a,b,i));
}
sort(query.begin(),query.end());
int ind=0;
seg.build(1,n,1);
for(int i=1;i<=n;i++)
{
int valu=data[i];
if(valu<=n)
{
cnt[valu]++;
pos[valu].push_back(i);
if(cnt[valu]>=valu)
{
if(cnt[valu]>valu)
seg.updata(pos[valu][cnt[valu]-valu-1],1,-2);
if(cnt[valu]>valu+1)
seg.updata(pos[valu][cnt[valu]-valu-2],1,1);
seg.updata(pos[valu][cnt[valu]-valu],1,1);
}
}
while(query[ind].ed==i&&ind<m)
{
res[query[ind].id]=seg.query(query[ind].st,query[ind].ed,1);
ind++;
}
}
for(int i=0;i<m;i++) printf("%d\n",res[i]);
return 0;
}