莫队模板题
Code:
#include<bits/stdc++.h>
using namespace std;
inline int read(){
int res=0,f=1;char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
return res*f;
}
const int N=50005,S=230;
struct query{int l,r,id,bl;}q[N];
int n,m,k,sqr;
int a[N];
inline bool cmp(query x,query y){
if(x.bl==y.bl) return x.r<y.r;
return x.bl<y.bl;
}
int cnt[N];
int tot[N];
int main(){
n=read();sqr=sqrt(n);m=read();k=read();
for(int i=1;i<=n;i++) a[i]=read();
for(int i=1;i<=m;i++){
q[i].l=read(),q[i].r=read();q[i].id=i;
q[i].bl=(q[i].l-1)/sqr+1;
}
sort(q+1,q+m+1,cmp);
int tl=1,tr=0,ans=0;
for(int l,r,i=1;i<=m;i++){
l=q[i].l,r=q[i].r;
while(tl>l) --tl,++cnt[a[tl]],ans+=2*cnt[a[tl]]-1;
while(tr<r) ++tr,++cnt[a[tr]],ans+=2*cnt[a[tr]]-1;
while(tl<l) --cnt[a[tl]],ans-=2*cnt[a[tl]]+1,++tl;
while(tr>r) --cnt[a[tr]],ans-=2*cnt[a[tr]]+1,--tr;
tot[q[i].id]=ans;
}
for(int i=1;i<=m;i++) cout<<tot[i]<<"\n";
return 0;
}