P2709 小B的询问

https://www.luogu.org/problemnew/show/P2709

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <queue>
#include <stack>
#include <cmath>
#define ll long long
using namespace std;

const int MAXN=50005;
int n,m,k,b[MAXN],size,cnt[MAXN];
ll ans[MAXN];
struct cyq{
	int l,r,id,p;
	bool operator <(const cyq &x)const{if(p==x.p)return r<x.r;
    else return p<x.p;}
}a[MAXN];

int main(){
	scanf("%d%d%d",&n,&m,&k);size=sqrt(n);
	for(int i=1;i<=n;i++) scanf("%d",&b[i]);
	for(int i=1;i<=m;i++){
		scanf("%d%d",&a[i].l,&a[i].r);
		a[i].id=i;a[i].p=(a[i].l-1)/size+1;
	}sort(a+1,a+m+1);
	int l=1,r=0;ll as=0;
	for(int i=1;i<=m;i++){
		while(r<a[i].r) {r++,cnt[b[r]]++,as+=2*cnt[b[r]]-1;}
		while(l>a[i].l) {l--,cnt[b[l]]++,as+=2*cnt[b[l]]-1;}
        while(r>a[i].r) {cnt[b[r]]--,as-=2*cnt[b[r]]+1,r--;}
        while(l<a[i].l) {cnt[b[l]]--,as-=2*cnt[b[l]]+1,l++;}
        ans[a[i].id]=as;
	}
	for(int i=1;i<=m;i++) printf("%lld\n",ans[i]);
	return 0;
}