BZOJ3781【莫队算法】

/* I will wait for you*/

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <ctime>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <string>
#define make make_pair
#define fi first
#define se second

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;

const int maxn = 100010;
const int maxm = 1010;
const int maxs = 26;
const int inf = 0x3f3f3f3f;
const int P = 1000000007;
const double error = 1e-9;

inline int read()
{
	int x = 0, f = 1;
	char ch = getchar();
	while (ch <= 47 || ch >= 58)
		f = (ch == 45 ? -1 : 1), ch = getchar();
	while (ch >= 48 && ch <= 57)
		x = x * 10 + ch - 48, ch = getchar();
	return x * f;
}

struct query
{
	int l, r, pos;
} e[maxn];

int c[maxn], sum[maxn]; ll fin[maxn];

bool operator < (query a, query b)
{
	int sa = a.l / 400, sb = b.l / 400;
	return sa < sb || sa == sb && a.r < b.r;
}

int main()
{
	int n = read(), m = read(), k = read();

	for (int i = 1; i <= n; i++)
		c[i] = read();

	for (int i = 1; i <= m ;i++) {
		e[i].l = read(), e[i].r = read();
		e[i].pos = i;
	}

	sort(e + 1, e + 1 + m);

	int l = 1, r = 0; ll ans = 0;

	for (int i = 1; i <= m; i++) {
		while (l > e[i].l) {
			sum[c[--l]]++;
			ans += 2 * sum[c[l]] - 1;
		}
		while (r < e[i].r) {
			sum[c[++r]]++;
			ans += 2 * sum[c[r]] - 1;
		}
		while (l < e[i].l) {
			sum[c[l]]--;
			ans -= 2 * sum[c[l++]] + 1;
		}
		while (r > e[i].r) {
			sum[c[r]]--;
			ans -= 2 * sum[c[r--]] + 1;
		}
		fin[e[i].pos] = ans;
	}

	for (int i = 1; i <= m ;i++)
		printf("%lld\n", fin[i]);

	return 0;
}