P2709 小B的询问 莫队算法

#include<bits/stdc++.h>
using namespace std;
#define rep(x,y,z) for(int (x)=(y);(x)<(z);x++)
#define mst(x,y) memset(x,y,sizeof(x))
#define ll long long
#define pii pair<int,int> 
#define piii pair<int,pii>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define debug cout<<"YES"<<endl;
int gcd(int x,int y){return y?gcd(y,x%y):x;}

const int maxn=5e4+5;
struct Q{
    int l,r,k;
}q[maxn];
int sz,n,m,k,a[maxn],cnt[maxn];
ll ans[maxn],res=0;
void Add(int x){
    x=a[x],cnt[x]++;
    res+=2*cnt[x]-1;
}
void Sub(int x){
    x=a[x],cnt[x]--;
    res-=2*cnt[x]+1;
}
int main(){
    ios::sync_with_stdio(false);
    cin>>n>>m>>k;sz=sqrt(n);
    rep(i,1,n+1) cin>>a[i];
    rep(i,0,m){
        cin>>q[i].l>>q[i].r;
        q[i].k=i;
    }
    sort(q,q+m,[](Q x,Q y){
        return (x.l/sz==y.l/sz)?x.r<y.r:(x.l/sz)<(y.l/sz);
    });
    int l=1,r=0;
    rep(i,0,m){
        while(l<q[i].l) Sub(l++);
        while(l>q[i].l) Add(--l);
        while(r<q[i].r) Add(++r);
        while(r>q[i].r) Sub(r--);
        ans[q[i].k]=res;
    }
    rep(i,0,m) cout<<ans[i]<<"\n";
    return 0;
}