莫队算法

 题目链接:https://www.lydsy.com/JudgeOnline/problem.php?id=2038

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int a[50005],be[50005],sum[50005];
int n,m,ans;
ll GCD(ll a,ll b)
{
    while(b^=a^=b^=a%=b);
    return a;
}
struct node
{
    int l,r,id;
    ll A,B;
} qe[50005];
bool cmp(node q1,node q2)
{
    return be[q1.l]==be[q2.l]?q1.r<q2.r:q1.l<q2.l;
}
bool CMP(node q1,node q2)
{
    return q1.id<q2.id;
}
void revise(int x,int add)
{
    ans-=sum[a[x]]*sum[a[x]];
    sum[a[x]]+=add;
    ans+=sum[a[x]]*sum[a[x]];
}
int main()
{
    scanf("%d%d",&n,&m);
    int unit=sqrt(n);//最优复杂度的分块
    for (int i=1; i<=n; i++ )
    {
        scanf("%d",&a[i]);
        be[i]=i/unit+1;
    }
    for (int i=1; i<=m; i++ )
    {
        scanf("%d%d",&qe[i].l,&qe[i].r);
        qe[i].id=i;
    }
    sort(qe+1,qe+1+m,cmp);
    int l=1,r=0;
    for (int i=1; i<=m; i++ )
    {
        while(l<qe[i].l)revise(l,-1),l++;
        while(l>qe[i].l)revise(l-1,1),l--;
        while(r<qe[i].r)revise(r+1,1),r++;
        while(r>qe[i].r)revise(r,-1),r--;

        if(qe[i].r==qe[i].l)
        {
            qe[i].A=0;
            qe[i].B=1;
            continue;
        }
        qe[i].A=ans-(qe[i].r-qe[i].l+1);
        qe[i].B=1ll*(qe[i].r-qe[i].l+1)*(qe[i].r-qe[i].l);
        ll c=GCD(qe[i].A,qe[i].B);
        qe[i].A/=c;
        qe[i].B/=c;
    }
    sort(qe+1,qe+1+m,CMP);
    for (int i=1; i<=m; i++ )
    {
        printf("%lld/%lld\n",qe[i].A,qe[i].B);
    }

}