HYSBZ-2743-采花

跟上个题比较像，也是离线算法+树状数组

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=50010;
const int maxa=1e6+100;
const int maxb=200011;
struct node
{
    int pre;
    int last;
    int id;
    bool operator <(const node &a)const
    {
	if(last==a.last)
	    return pre<a.pre;
	return last<a.last;
    }
}a[maxb];
int n,m,c[maxn],t[maxn],pre[maxa],last[maxa],ans[maxb];
int lowbit(int x)
{
    return x&(-x);
}
int sum(int i)
{
    int ans=0;
    for(;i>0;ans+=t[i],i-=lowbit(i));
    return ans;	
}
void update(int i,int val)
{
    for(;i<=n;i+=lowbit(i))
	t[i]+=val;
}
int main()
{
    while(scanf("%d",&n)!=EOF)
    {
	memset(last,0,sizeof(last));
	memset(t,0,sizeof(t));
	for(int i=1;i<=n;i++)
	{
	    scanf("%d",&c[i]);
	    pre[i]=last[c[i]];
	    last[c[i]]=i;
	}
	scanf("%d",&m);
	for(int i=0;i<m;i++)
	{
	    scanf("%d%d",&a[i].pre,&a[i].last);
	    a[i].id=i;
	}
	sort(a,a+m);
	int now=1;
	for(int i=0;i<m;i++)
	{
	    while(now<=a[i].last)
	    {
		update(pre[now++]+1,1);
		update(now,-1);
	    }
	    ans[a[i].id]=sum(a[i].pre);
	}
	for(int i=0;i<m;i++)
	    printf("%d\n",ans[i]);
    }
    return 0;
}