传送门
解法:
1.莫队
2.主席树
3.(离线)树状数组
理论时间复杂度第二/三个要快一点,logn比根号n小一些,但是不知道为什么贴的别人的代码(含读优)跑出来反而慢ㄟ( ▔, ▔ )ㄏ
#include<bits/stdc++.h>
using namespace std;
const int MAXN=5e4+4,MAXM=2e5+4;
int n,m,siz;
int cnt[MAXM*5],bel[MAXN],num[MAXN],ans[MAXM];
struct Q {
int l,r,id;
friend bool operator <(const Q &x,const Q &y) {
return bel[x.l]==bel[y.l]?x.r<y.r:x.l<y.l;
}
}q[MAXM];
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;
}
int main() {
// freopen("bzoj 1878.in","r",stdin);
n=read();
for (register int i=1;i<=n;++i) num[i]=read();
siz=(int)sqrt((double)n);
for (register int i=1;i<=n;++i) bel[i]=i/siz;
m=read();
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);
for (register int i=1,l=1,r=0,ret=0;i<=m;++i) {
while (l>q[i].l) {++cnt[num[--l]];if (cnt[num[l]]==1) ++ret;}
while (r<q[i].r) {++cnt[num[++r]];if (cnt[num[r]]==1) ++ret;}
while (l<q[i].l) {--cnt[num[l++]];if (cnt[num[l-1]]==0) --ret;}//-1!!!
while (r>q[i].r) {--cnt[num[r--]];if (cnt[num[r+1]]==0) --ret;}//+1!!!
ans[q[i].id]=ret;
}
for (register int i=1;i<=m;++i) printf("%d\n",ans[i]);
return 0;
}
主席树:
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int MAXN=5e4+4;
int n,m,a[MAXN],nxt[1000004];
int root[MAXN<<1],sum[(MAXN<<1)*22],lc[(MAXN<<1)*22],rc[(MAXN<<1)*22],tim=0;
inline int read() {
int x=0;char c=getchar();
while (c<'0'||c>'9') c=getchar();
while (c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
return x;
}
void Insert(int pre,int &rt,int l,int r,int pos,int delta) {
rt=++tim;
sum[rt]=sum[pre]+delta,rc[rt]=rc[pre],lc[rt]=lc[pre];
if (l==r) return ;
int mid=l+r>>1;
if (pos<=mid) Insert(lc[pre],lc[rt],l,mid,pos,delta);
else Insert(rc[pre],rc[rt],mid+1,r,pos,delta);
}
int query(int rt,int l,int r,int L,int R) {
if (L<=l&&r<=R) return sum[rt];
int mid=l+r>>1,ret=0;
if (L<=mid) ret+=query(lc[rt],l,mid,L,R);
if (mid<R) ret+=query(rc[rt],mid+1,r,L,R);
return ret;
}
int main() {
memset(nxt,-1,sizeof(nxt));
n=read();
for (register int i=1;i<=n;++i) {
a[i]=read();
if (~nxt[a[i]]) {
Insert(root[i-1],root[i],1,n,nxt[a[i]],-1);
Insert(root[i],root[i],1,n,i,1);
}
else Insert(root[i-1],root[i],1,n,i,1);
nxt[a[i]]=i;
}
m=read();
for (register int i=0;i<m;++i) {
int u=read(),v=read();
printf("%d\n",query(root[v],1,n,u,v));
}
return 0;
}