CodeForces 86D Powerful array 莫队算法

题目：http://codeforces.com/problemset/problem/86/D

题意：给定一个数组，每次询问一个区间[l, r]，设某个元素i出现的次数为num[i]，求区间内元素num[i] ^ 2 * i的和

思路：莫队算法简单题，元素范围为[1, 1000000]，要离散化一下， 不然会超时。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#define debug() puts("here")
using namespace std;

typedef long long ll;
const int N = 200010;
struct node
{
    int l, r, id;
}g[N];
int n, m, unit;
int num[N], a[N], b[N], c[N];
ll tmp, res[N];
bool cmp(node a, node b)
{
    return a.l/unit != b.l/unit ? a.l/unit < b.l/unit : a.r < b.r;
}
void add(int i)
{
    tmp -= (ll)num[a[i]]*num[a[i]]*c[i];
    num[a[i]]++;
    tmp += (ll)num[a[i]]*num[a[i]]*c[i];
}
void del(int i)
{
    tmp -= (ll)num[a[i]]*num[a[i]]*c[i];
    num[a[i]]--;
    tmp += (ll)num[a[i]]*num[a[i]]*c[i];
}
void solve()
{
    unit = (int)sqrt(1.0 * n);
    sort(g+1, g+1+m, cmp);
    int l = 1, r = 0;
    tmp = 0;
    for(int i = 1; i <= m; i++)
    {
        while(r < g[i].r) add(++r);
        while(r > g[i].r) del(r--);
        while(l < g[i].l) del(l++);
        while(l > g[i].l) add(--l);
        res[g[i].id] = tmp;
    }
    for(int i = 1; i <= m; i++) printf("%I64d\n", res[i]);
}
int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) scanf("%d", &a[i]), b[i] = c[i] = a[i];
    sort(b+1, b+1+n);
    for(int i = 1; i <= n; i++) a[i] = lower_bound(b+1, b+1+n, a[i]) - b;
    for(int i = 1; i <= m; i++) scanf("%d%d", &g[i].l, &g[i].r), g[i].id = i;
    solve();
    return 0;
}