NBUT - 1457 Sona （莫队+离散化）

最新推荐文章于 2021-10-06 17:16:12 发布

YOONGI

最新推荐文章于 2021-10-06 17:16:12 发布

阅读量259

点赞数

分类专栏：莫队

本文链接：https://blog.csdn.net/chimchim04/article/details/98944675

版权

莫队专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Sona

Sona , Maven of the Strings . Of cause, she can play the zither.

Sona can't speak but she can make fancy music. Her music can attack, heal, encourage and enchant.

There're an ancient score(乐谱). But because it's too long,Sona can't play it in a short moment. So Sona decide to just play a part of it and revise it.

A score is composed of notes. There are 109 kinds of notes and a score has 105 notes at most.

To diversify Sona's own score, she have to select several parts of it. The energy of each part is calculated like that:

Count the number of times that each notes appear. Sum each of the number of times' cube together. And the sum is the energy.

You should help Sona to calculate out the energy of each part.

Input

This problem contains several cases. And this problem provides 2 seconds to run.
The first line of each case is an integer N (1 ≤ N ≤ 10^5), indicates the number of notes.
Then N numbers followed. Each number is a kind of note. (1 ≤ NOTE ≤ 10^9)
Next line is an integer Q (1 ≤ Q ≤ 10^5), indicates the number of parts.
Next Q parts followed. Each part contains 2 integers Li and Ri, indicates the left side of the part and the right side of the part.

Output

For each part, you should output the energy of that part.

Sample Input

8
1 1 3 1 3 1 3 3
4
1 8
3 8
5 6
5 5

Sample Output

题目链接：https://ac.2333.moe/Problem/view.xhtml?id=1457

题目大意：给出长度为n的数列，m次查询，每次查询求出区间 [ l ,r ] 内相同数字出现次数的立方和

思路：ai 最大能到10^9，先把数组a离散化，然后是莫队模板

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<math.h>
using namespace std;
#define ll long long
const int N=200010;
int a[N],e[N],k;
ll ans,b[N],c[N];
struct node
{
    int l,r,id,pos;
}q[N];
bool cmp(node a,node b)
{
    if(a.pos==b.pos) return a.r<b.r;
    return a.pos<b.pos;
}
void update(int x,int p)
{
    if(x==0) return;
    ans-=c[a[x]]*c[a[x]]*c[a[x]];
    c[a[x]]+=p;
    ans+=c[a[x]]*c[a[x]]*c[a[x]];
}
int main()
{
        int n,m;
        while(~scanf("%d",&n)){
        int p=sqrt(n);
        for(int i=1;i<=n;i++) scanf("%d",&a[i]),e[i]=a[i],c[i]=0;
        sort(e+1,e+1+n);
        k=unique(e+1,e+n+1)-(e+1);
        for(int i=1;i<=n;i++) a[i]=lower_bound(e+1,e+1+k,a[i])-e;
        scanf("%d",&m);
        for(int i=0;i<m;i++)
        {
            scanf("%d%d",&q[i].l,&q[i].r);
            q[i].id=i;
            q[i].pos=q[i].l/p;
        }
        sort(q,q+m,cmp);
        int l=0,r=0;
        ans=0;
        for(int i=0;i<m;i++)
        {
            while(l<q[i].l) update(l++,-1);
            while(l>q[i].l) update(--l,1);
            while(r>q[i].r) update(r--,-1);
            while(r<q[i].r) update(++r,1);
            b[q[i].id]=ans;
        }
        for(int i=0;i<m;i++)
            printf("%lld\n",b[i]);
        }
    return 0;
}