codeforce 86D Powerful array 莫对算法

简单莫队算法题，对于她给的公式来说怎么，每一次转移区间的是候用一个数组来位数每个数值的数的个数即可。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;
const int maxn=200005;
typedef long long LL;
int a[1000006],b[maxn];
struct pi{
    int l,r;
    int x;
    int id;
}pp[maxn];
LL s1[maxn];
int cmp(pi a,pi b){
    if(a.x!=b.x) return a.x<b.x;
    return a.r<b.r;
}
int main()
{
    int i,j,n,m,p;
    cin>>n>>m;
    for(i=1;i<=n;i++) scanf("%d",&b[i]);
    LL s=0;
    p=sqrt(n);
    for(i=0;i<m;i++){
        scanf("%d%d",&pp[i].l,&pp[i].r);
        pp[i].id=i;
        pp[i].x=(pp[i].l-1)/p+1;
    }
    sort(pp,pp+m,cmp);
    int l=0,r=0;
    for(i=0;i<m;i++){
        if(i==0){
            for(j=pp[i].l;j<=pp[i].r;j++){
                if(a[b[j]]>=0){ s-=(LL)a[b[j]]*a[b[j]]*b[j];
                    s+=(LL)(a[b[j]]+1)*(a[b[j]]+1)*b[j];
                }
                a[b[j]]++;
            }
        }
        else{
            if(l<pp[i].l){
                for(j=l;j<pp[i].l;j++){
                    if(a[b[j]]>0){
                        s-=(LL)a[b[j]]*a[b[j]]*b[j];
                        s+=(LL)(a[b[j]]-1)*(a[b[j]]-1)*b[j];
                    }
                    a[b[j]]--;
                }
            }
            else {
                for(j=l-1;j>=pp[i].l;j--){
                    if(a[b[j]]>=0){ s-=(LL)a[b[j]]*a[b[j]]*b[j];
                        s+=(LL)(a[b[j]]+1)*(a[b[j]]+1)*b[j];
                    }
                    a[b[j]]++;
                }
            }
            if(r<pp[i].r){
                for(j=r+1;j<=pp[i].r;j++){
                    if(a[b[j]]>=0){ s-=(LL)a[b[j]]*a[b[j]]*b[j];
                        s+=(LL)(a[b[j]]+1)*(a[b[j]]+1)*b[j];
                    }
                    a[b[j]]++;
                }
            }
            else{
                for(j=r;j>pp[i].r;j--){
                    if(a[b[j]]>0){
                        s-=(LL)a[b[j]]*a[b[j]]*b[j];
                        s+=(LL)(a[b[j]]-1)*(a[b[j]]-1)*b[j];
                    }
                    a[b[j]]--;
                }
            }
        }
        s1[pp[i].id]=s;
        l=pp[i].l;
        r=pp[i].r;
    }
    for(i=0;i<m;i++) printf("%I64d\n",s1[i]);