2038: [2009国家集训队]小Z的袜子(hose)

https://www.lydsy.com/JudgeOnline/problem.php?id=2038

总结：莫队，离线处理区间询问；维护每次移动是贡献的变化！分块排序后就优化了；

#include<algorithm>
#include<set>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back`
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=5e4+9;
const int mod=1e9+7;

inline ll read()
{
    ll f=1,x=0;

    char ss=getchar();
    while(ss<'0'||ss>'9')
    {
        if(ss=='-')f=-1;ss=getchar();
    }
    while(ss>='0'&&ss<='9')
    {
        x=x*10+ss-'0';ss=getchar();
    }    return f*x;
}

struct Mo
{
    int l,r;
    int id;
    ll zi,mu;
}q[maxn];
int Be[maxn];//分块
int col[maxn];
ll ans=0;
ll sum[maxn];
bool cmp1(Mo x,Mo y)
{
    if(Be[x.l]==Be[y.l]) return x.r<y.r;
    return x.l<y.l;
}
bool cmp2(Mo x,Mo y)
{
    return x.id<y.id;
}
void solve(int x,int add)
{
    ans-=(sum[col[x]]*sum[col[x]]);
    sum[col[x]]+=add;
    ans+=(sum[col[x]]*sum[col[x]]);
}
int main()
{
    //FAST_IO;
    //freopen("input.txt","r",stdin);

    int n,m;
    cin>>n>>m;
    int u=sqrt(n);
    for(int i=1;i<=n;i++)
    {
        cin>>col[i];
        Be[i]=i/u+1;
    }
    for(int i=1;i<=m;i++)
    {
        cin>>q[i].l>>q[i].r;
        q[i].id=i;
    }
    sort(q+1,q+m+1,cmp1);
    int l=1,r=0;//注意开始状态
    for(int i=1;i<=m;i++)
    {
        while(r<q[i].r) solve(r+1,1),r++;
        while(r>q[i].r) solve(r,-1),r--;
        while(l<q[i].l) solve(l,-1),l++;
        while(l>q[i].l) solve(l-1,1),l--;

        if(q[i].l==q[i].r)
        {
            q[i].zi=0,q[i].mu=1;
            continue;
        }

        ll zi=ans-(q[i].r-q[i].l+1);
        ll mu=1LL*(q[i].r-q[i].l+1)*(q[i].r-q[i].l);
        ll g=__gcd(zi,mu);
        q[i].zi=zi/g;
        q[i].mu=mu/g;
    }
    sort(q+1,q+m+1,cmp2);
    for(int i=1;i<=m;i++)
    {
        cout<<q[i].zi<<"/"<<q[i].mu<<endl;
    }
    return 0;
}