莫队P2709 小B的询问

#include <bits/stdc++.h>
using namespace std;


inline long long read() {
	char ch = getchar();
	long long f = 1,x = 0;
	while (ch > '9' || ch < '0') { if (ch == '-')f = -1; ch = getchar(); }
	while (ch >= '0' && ch <= '9') { x = (x << 1) + (x << 3) + ch - '0'; ch = getchar(); }
	return x * f;
}
//void ReadFile() {
//	FILE* stream1;
//	freopen_s(&stream1,"in.txt", "r", stdin);
//	freopen_s(&stream1,"out.txt", "w", stdout);
//}

static auto speedup = []() {ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); return nullptr; }();

const int maxn = 5e4 + 7;
int a[maxn],pos[maxn],cnt[maxn];
long long ans[maxn],res = 0;
struct Node {
	int l, r, k;
	bool operator<(const Node& input) {
		if (pos[l] != pos[input.l]) return pos[l] < pos[input.l];
		return r < input.r;
	}
}q[maxn];

void Add(int x) {
	int & c = ++cnt[a[x]];
	res += c * c - (c - 1) * (c - 1);
}
void Sub(int  x) {
	int& c = --cnt[a[x]];
	res -= (c + 1) * (c + 1) - c * c;
}
void slove() {
	int n, m, k;
	cin >> n >> m >> k;
	int siz = sqrt(n);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		pos[i] = i / siz;
	}

	for (int i = 0; i < m; i++) {
		cin >> q[i].l >> q[i].r;
		q[i].k = i;
	}
	sort(q, q + m);
	int l = 1, r = 0;
	for (int i = 0; i < m; i++) {
		while (q[i].l < l)Add(--l);
		while (q[i].r > r)Add(++r);
		while (q[i].l > l)Sub(l++);
		while (q[i].r < r)Sub(r--);
		ans[q[i].k] = res;
	}
	for (int i = 0; i < m; i++)
		cout << ans[i] << endl;

}
int main() {
	slove();
	return 0;
}