BZOJ2038【莫队算法】

/* 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 pos, x, y;
} e[maxn];

bool cmp(query a, query b)
{
	return a.x / 300 > b.x / 300 ||
	       a.x / 300 == b.x / 300 && a.y < b.y;
}

int n, m, color[maxn];
ll a, b, c, x, y, ans[maxn], tot[maxn], val[maxn];

ll gcd(ll a, ll b)
{
	return a ? gcd(b % a, a) : b;
}

void solve()
{
	ll tmp = 0; int l = 1, r = 0;

	for (int i = 1; i <= m; i++) {
		while (l > e[i].x) {
			tmp += 2 * tot[color[--l]];
			tot[color[l]]++;
		}

		while (r < e[i].y) {
			tmp += 2 * tot[color[++r]];
			tot[color[r]]++;
		}

		while (l < e[i].x) {
			tot[color[l]]--;
			tmp -= 2 * tot[color[l++]];
		}
		
		while (r > e[i].y) {
			tot[color[r]]--;
			tmp -= 2 * tot[color[r--]];
		}
		
		ans[e[i].pos] = tmp;
	}
}

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

	for (int i = 1; i <= n; i++)
		color[i] = read();
	
	for (int i = 1; i <= m; i++) {
		e[i].x = x = read(), e[i].y = y = read();
		e[i].pos = i, val[i] = (y - x + 1) * (y - x);
	}
	
	sort(e + 1, e + m + 1, cmp);

	solve();

	for (int i = 1; i <= m; i++) {
		a = ans[i], b = val[i], c = gcd(a, b);
		printf("%lld/%lld\n", a / c, b / c);
	}

	return 0;
}