https://www.lydsy.com/JudgeOnline/problem.php?id=2038
最经典的莫队算法问题。
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>
#include <queue>
#include <cmath>
using namespace std;
#define LL long long
const LL maxn = 50000+55;
LL a[maxn];
struct node
{
LL l,r;
LL id;
LL a,b;
}q[maxn];
int block;
int bk[maxn];
bool cmp(node a,node b)
{
if(bk[a.l]!=bk[b.l])
return bk[a.l]<bk[b.l];
return a.r<b.r;
}
bool CMP(node a,node b)
{
return a.id<b.id;
}
LL num[maxn];
LL ans=0;
void add(LL x)
{
ans+=2*num[x];
num[x]++;
}
void les(LL x)
{
ans=ans-2*num[x]+2;
num[x]--;
}
LL gcd(LL x,LL y)
{
return y==0?x:gcd(y,x%y);
}
int main()
{
LL n,m;
scanf("%lld%lld",&n,&m);
block=(int)sqrt(n);
for(int i=1;i<=n;i++)
bk[i]=(i-1)/block;
for(LL i=1;i<=n;i++)
scanf("%lld",&a[i]);
for(LL i=1;i<=m;i++){
scanf("%lld%lld",&q[i].l,&q[i].r);
q[i].id=i;
}
sort(q+1,q+1+m,cmp);
LL l=1,r=0;
for(LL i=1;i<=m;i++){
while(l<q[i].l) les(a[l++]);
while(l>q[i].l) add(a[--l]);
while(r<q[i].r) add(a[++r]);
while(r>q[i].r) les(a[r--]);
LL a=ans;
LL b=(r-l+1)*(r-l);
LL d=gcd(a,b);
q[i].a=ans/d;q[i].b=b/d;
}
sort(q+1,q+1+m,CMP);
for(LL i=1;i<=m;i++){
if(q[i].a==0) printf("0/1\n");
else printf("%lld/%lld\n",q[i].a,q[i].b);
}
return 0;
}