Codeforces 86D Powerful array （莫队）

阅读量：6174 次

发布时间：2019-06-21

本文共 3407 字，大约阅读时间需要 11 分钟。

An array of positive integers a1, a2, ..., an is given. Let us consider its arbitrary subarray al, al + 1..., ar, where 1 ≤ l ≤ r ≤ n. For every positive integer s denote by Ks the number of occurrences of s into the subarray. We call the power of the subarray the sum of products Ks·Ks·s for every positive integer s. The sum contains only finite number of nonzero summands as the number of different values in the array is indeed finite.

You should calculate the power of t given subarrays.

Input

First line contains two integers n and t (1 ≤ n, t ≤ 200000) — the array length and the number of queries correspondingly.

Second line contains n positive integers ai (1 ≤ ai ≤ 106) — the elements of the array.

Next t lines contain two positive integers l, r (1 ≤ l ≤ r ≤ n) each — the indices of the left and the right ends of the corresponding subarray.

Output

Output t lines, the i-th line of the output should contain single positive integer — the power of the i-th query subarray.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preferred to use cout stream (also you may use %I64d).

Examples

input

3 2 1 2 1 1 2 1 3

output

3 6

input

8 3 1 1 2 2 1 3 1 1 2 7 1 6 2 7

output

20 20 20

Note

Consider the following array (see the second sample) and its [2, 7] subarray (elements of the subarray are colored):

$\text{[math]}$

Then

K1 = 3, K2 = 2, K3 = 1, so the power is equal to 3²·1 + 2²·2 + 1²·3 = 20.

题意：

　　给你一个序列a_n 。t次询问，问在[L, R] 的区间里面的值是多少。公式是：ai的个数的平方 * ai 的求和。具体看Note。

题解：

　　这一题用莫队算法。如果做过小Z的袜子的话，这一题很简单，小Z的袜子是 ai个数的平方求和，这里就乘多了一个ai。

　　巨坑：num[] 数组要用int 开，用long long开的话会被卡TLE。（很绝望，被卡了10次罚时，最后用输入挂才过的）

1 #include 
      
         2 #include 
       
          3 #include 
        
           4 #include 
         
            5 #include 
          
             6 #include 
           
             7 #include 
            
              8 #include 
             
               9 #include 
               10 #include 
               
                 11 #include 
                
                  12 using namespace std; 13 typedef long long LL; 14 #define ms(a, b) memset(a, b, sizeof(a)) 15 #define pb push_back 16 #define mp make_pair 17 const LL INF = 0x7fffffff; 18 const int inf = 0x3f3f3f3f; 19 const int mod = 1e9+7; 20 const int maxn = 1000000+10; 21 22 template
                 
                   23 inline bool scan_d(T &ret){ 24 char c;int sgn; 25 if(c=getchar(), c==EOF) return 0; 26 while(c!='-'&&(c<'0'||c>'9')) c = getchar(); 27 sgn=(c=='-')?-1:1; 28 ret=(c=='-')?0:(c-'0'); 29 while(c=getchar(), c>='0'&&c<='9') ret = ret*10+(c-'0'); 30 ret*=sgn; 31 return 1; 32 } 33 inline void out(LL x) 34 { 35 if(x>9) out(x/10); 36 putchar(x%10+'0'); 37 } 38 39 int a[maxn]; 40 int unit, n, t; 41 LL ans[maxn]; 42 int num[maxn]; 43 44 45 46 struct node 47 { 48 int l, r, id; 49 }que[maxn]; 50 void init() { 51 ms(num, 0); 52 } 53 bool cmp(node x1, node x2) 54 { 55 if(x1.l/unit != x2.l/unit){ 56 return x1.l/unit < x2.l/unit; 57 } 58 else{ 59 return x1.r < x2.r; 60 } 61 } 62 void work() 63 { 64 sort(que, que+t, cmp); 65 LL temp = 0; 66 int l, r; 67 l = 0, r = 0; 68 for(int i =0;i
                  
                   que[i].r){ 76 temp -= 1LL*num[a[r]]*num[a[r]]*a[r]; 77 num[a[r]]--; 78 temp += 1LL*num[a[r]]*num[a[r]]*a[r]; 79 r--; 80 } 81 while(l>que[i].l){ 82 l--; 83 temp -= 1LL*num[a[l]]*num[a[l]]*a[l]; 84 num[a[l]]++; 85 temp += 1LL*num[a[l]]*num[a[l]]*a[l]; 86 } 87 while(l

View Code

转载于:https://www.cnblogs.com/denghaiquan/p/7226432.html

你可能感兴趣的文章

宇宙风暴？才怪!瑞典暗指俄罗斯黑客攻击航空控制系统