使用一个 n e x t [ ] next[] next[],记录改颜色下一次出现的位置,并用可持久化线段树进行维护,查询时该区间内 n e x t [ i ] > r next[i]>r next[i]>r的个数即使颜色种数
注意next需要设置最右端点,即 n + 1 n+1 n+1
#include <bits/stdc++.h>
#define inf 0x7fffffff
#define ll long long
//#define int long long
//#define double long double
//#define double long long
#define re register int
//#define void inline void
#define eps 1e-8
//#define mod 1e9+7
#define ls(p) p<<1
#define rs(p) p<<1|1
#define pi acos(-1.0)
#define pb push_back
#define mk make_pair
#define P pair < int , int >
using namespace std;
const int mod= 998244353;
//const int inf=1e18;
const int M=1e8;
const int N=1e6+5;//??????.???? 4e8
struct bnod
{
int l,r,sum;
}e[N*40];
int tot;
int head[N],next[N];
int a[N],n,m;
int rt[N];
inline void read(int &x){
char ch=getchar();int f=1;x=0;
while(!isdigit(ch) && ch^'-') ch=getchar();
if(ch=='-') f=-1,ch=getchar();
while(isdigit(ch)) x=x*10+ch-'0',ch=getchar();
x*=f;
}
void insert(int &p,int pre,int l,int r,int pos)
{
e[++tot]=e[pre];
p=tot;
e[p].sum++;
if(l==r) return;
int mid=(l+r)>>1;
if(pos<=mid) insert(e[p].l,e[pre].l,l,mid,pos);
else insert(e[p].r,e[pre].r,mid+1,r,pos);
}
int ask(int L,int R,int l,int r,int pos)
{
if(l==r) return e[R].sum-e[L].sum;
int mid=(l+r)>>1;
if(pos<=mid) return ask(e[L].l,e[R].l,l,mid,pos)+e[e[R].r].sum-e[e[L].r].sum;
return ask(e[L].r,e[R].r,mid+1,r,pos);
}
void solve()
{
read(n);
for(re i=1;i<=n;i++)
{
read(a[i]);
if(head[a[i]]) next[head[a[i]]]=i;
head[a[i]]=i;
}
for(re i=1;i<=n;i++) if(!next[i]) next[i]=n+1;
for(re i=1;i<=n;i++) insert(rt[i],rt[i-1],1,n+1,next[i]);
read(m);
while(m--)
{
int l,r;
read(l);read(r);
printf("%d\n",ask(rt[l-1],rt[r],1,n+1,r+1));
}
}
signed main()
{
int T=1;
// cin>>T;
for(int index=1;index<=T;index++)
{
solve();
// puts("");
}
return 0;
}
/*
*/