codeforces 86 D. Powerful array(莫队)

题目链接：https://codeforc.es/contest/86/problem/D

思路：模板题

#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef vector<long long> VI;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define SZ(x) ((long long)(x).size())
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
ll n,t,a[200008],l,r,s,qw[1000008],b[200008],zz;
struct as{
int l,r,d;
ll ss;}d[200008];
bool cmp(as x,as y){
    if(b[x.l]!=b[y.l])return b[x.l]<b[y.l];
    if(b[x.l]&1)return x.r<y.r;
    return x.r>y.r;
}
bool cmp1(as a,as b){return a.d<b.d;}
void add(int x,ll y)
{
    if(y==-1) qw[a[x]]+=y;
    s+=(2ll*qw[a[x]]+1)*y*a[x];
    if(y==1) qw[a[x]]+=y;
    //cout<<a[x]<<" "<<x<<" "<<s<<endl;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    cin>>n>>t;
    zz=sqrt(n);
    FOR(i,1,n) sl(a[i]),b[i]=i/zz+1;
    //FOR(i,1,1000000) s+=qw[i]*qw[i]*(ll)i;
    FOR(i,1,t) sl(d[i].l),sl(d[i].r),d[i].d=i;
    sort(d+1,d+t+1,cmp);
    int l=1,r=0;
    FOR(i,1,t)
    {
        while(l<d[i].l)add(l,-1),l++;
        while(l>d[i].l)add(l-1,1),l--;
        while(r<d[i].r)add(r+1,1),r++;
        while(r>d[i].r)add(r,-1),r--;
        d[i].ss=s;
        //cout<<d[i].l<<" "<<d[i].r<<endl;
    }
    sort(d+1,d+t+1,cmp1);
    FOR(i,1,t)
     printf("%lld\n",d[i].ss);
    return 0;
}