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
128
72
2
1

题意： 给定N个数和m次查询，查询给定范围内不同种类颜色出现次数的立方和。

题解：莫队算法加离散化

代码如下

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
long long a[200010],b[200010],c[200010];
long long sum,k,d[200010];
struct z{int l,r,id,p;
} s[200010];
bool cmp(z a,z b)   //对查询进行排序
{if(a.p==b.p)return a.r<b.r;elsereturn a.p<b.p;
}
void add(int x,int y)  //随着范围移动数据加减
{if(x==0)return ;sum=sum-c[a[x]]*c[a[x]]*c[a[x]];  //减去原来的c[a[x]]=c[a[x]]+y;sum=sum+c[a[x]]*c[a[x]]*c[a[x]];  //加上现在的
}
int main()
{int n,m;while(~scanf("%d",&n)&&n){int i,j,l=0,r=0;for(i=1;i<=n;i++){scanf("%lld",&a[i]);d[i]=a[i];c[i]=0;}scanf("%d",&m);sort(d+1,d+1+n);k=unique(d+1,d+n+1)-(d+1);for(i=1;i<=n;i++)a[i]=lower_bound(d+1,d+1+k,a[i])-d;   //离散化进行优化 int x=sqrt(n);for(i=0;i<m;i++){scanf("%d%d",&s[i].l,&s[i].r);s[i].id=i;s[i].p=s[i].l/x;}sort(s,s+m,cmp);sum=0;for(i=0;i<m;i++)          //莫队 {while(l<s[i].l) add(l++,(-1));while(l>s[i].l) add(--l,1);while(r>s[i].r) add(r--,(-1));while(r<s[i].r) add(++r,1);b[s[i].id]=sum;}for(i=0;i<m;i++)printf("%lld\n",b[i]);}return 0;
}

Sona(莫队+离散化)相关推荐

（NBUT - 1457）Sona（莫队+离散化）
题目链接:Sona - NBUT 1457 - Virtual Judge (ppsucxtt.cn) 题意比较简单:有N个数,有M个询问,求每次询问的区间[L,R]中,每种数字出现次数的立方和. 在 ...
NBUT 1457 Sona (莫队算法)
[1457] Sona 时间限制: 5000 ms 内存限制: 65535 K 问题描述 Sona, Maven of the Strings. Of cause, she can play the ...
NBUT 1457 Sona 莫队算法分块处理
[1457] Sona 时间限制: 5000 ms 内存限制: 65535 K 问题描述 Sona, Maven of the Strings. Of cause, she can play the ...
NBUT1457 Sona 莫队算法
由于10^9很大,所以先离散化一下,把给你的这一段数哈希时间复杂度O(nlogn) 然后就是分块莫队已知[L,R],由于事先的离散化,可以在O(1)的的时间更新[l+1,r],[l,r+1],[l ...
带修莫队 ---- 离散化 + 暴力 + 带修莫队 F. Machine Learning
题目链接题目大意: 给出nnn个数字,qqq个询问: 每次询问有两种类型,一种是询问区间,一种是单体修改: 询问区间是询问区间内最小的没用到的大于0的整数: 比如我有一串数字是 1 1 2 2 2 ...
NBUT - 1457 Sona (莫队算法)
点我看题题意:求某段区间内数字出现次数的立方和. 分析:莫队的模板题,不得不说这题神坑,vj说好的操作系统为Linux呢???结果%I64d才能过== 当然这题不用输入挂其实也能过- #includ ...
NBUT - 1457 Sona 莫队
NBUT - 1457 Sona 题意: 计算一个区间内每种数出现次数的立方和,那么转移的话,假设一个区间是[L,R],如果向左转移,用ans保存区间的答案,cnt[i]记录第 i 种数出现的次数,那 ...
HDU 4417 Super Mario（莫队 + 树状数组 + 离散化）
Super Mario 思路区间查找问题,容易想到离线莫队,确实这题就是莫队,接下来我们考虑如何维护区间高度值问题. 既然是离线嘛,我们容易想到离散化和他挂钩,想想这题是否需要离散化,高度的最大值是 ...
分治 —— 莫队算法
[概述] 莫队算法(mo's algorithm)是用来解决离线区间不修改询问问题,可以将复杂度优化到 O(n^1.5),除去普通的莫队算法外,还有带修改的莫队.树上莫队等等. 莫队常用于维护区间答案 ...

Sona(莫队+离散化)

Sona(莫队+离散化)相关推荐

最新文章

热门文章