NBUT1457 Sona 莫队算法

/*96655 ‘s source code for B
Memory: 3744 KB        Time: 2968 MS
Language: G++        Result: Accepted
*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<iostream>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
#include<cmath>
using namespace std;
typedef long long LL;
const int maxn=100005;
map<int,int>mp;
int a[maxn],pos[maxn],b[maxn];
LL sum;
struct node
{
    int l,r,id;
    LL ans;
} res[maxn];
bool cmp1(node a,node b)
{
    if(pos[a.l]==pos[b.l])return a.r<b.r;
    return a.l<b.l;
}
bool cmp2(node a,node b)
{
    return a.id<b.id;
}
void change(int pos,int op)
{

    LL temp=b[a[pos]];
    sum-=temp*temp*temp;
    b[a[pos]]+=op;
    temp=b[a[pos]];
    sum+=temp*temp*temp;
}
int main()
{
    int n,q;
    while(~scanf("%d",&n))
    {
        double cn=n;
        int blk=(int)(sqrt(cn));
        sum=0,mp.clear();
        for(int i=1; i<=n; ++i)
            scanf("%d",&a[i]),pos[i]=(i-1)/blk+1,b[i]=a[i];
        sort(b+1,b+n+1);
        int cnt=2;
        for(int i=2; i<=n; ++i)
            if(b[i]!=b[i-1])b[cnt++]=b[i];
        --cnt;
        for(int i=1; i<=n; ++i)
            a[i]=lower_bound(b+1,b+1+cnt,a[i])-(b+1);
        memset(b,0,sizeof(b));
        scanf("%d",&q);
        for(int i=1; i<=q; ++i)
            scanf("%d%d",&res[i].l,&res[i].r),res[i].id=i;
        sort(res+1,res+1+q,cmp1);
        for(int i=1,l=1,r=0; i<=q; ++i)
        {
            for(; r<res[i].r; ++r)
                change(r+1,1);
            for(; r>res[i].r; --r)
                change(r,-1);
            for(; l<res[i].l; ++l)
                change(l,-1);
            for(; l>res[i].l; --l)
                change(l-1,1);
            res[i].ans=sum;
        }
        sort(res+1,res+q+1,cmp2);
        for(int i=1; i<=q; ++i)
            printf("%I64d\n",res[i].ans);
    }
    return 0;
}