1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
| #include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#define re register
#define INF 0x7fffffff
using namespace std;
long long read()
{
long long x = 0,f = 1; char ch;
ch = getchar();
while(ch >'9' || ch < '0'){if(ch == '-') f = -f; ch = getchar();}
while(ch >= '0' && ch <= '9'){x = x * 10 + ch - '0'; ch = getchar();}
return x * f;
}
long long gcd(long long a, long long b){return a == 0 ? b : gcd(b % a, a);}
long long n,m,a[50005],xsort,p1,p2,t[50005],ans,cnt,g,ll,rr,in[50005],save1[50005],save2[50005];
struct query{
long long l,r,num;
}q[50005];
long long mysort(query x, query y)
{
if(x.l / xsort == y.l / xsort) return x.r < y.r;
return x.l < y.l;
}
long long work(long long x)
{
return x * x;
}
void add(long long k)
{
long long u = a[k];
if(k == 0) return ;
ans = ans - work(t[u]);
t[u] ++;
ans = ans + work(t[u]);
}
void del(long long k)
{
long long u = a[k];
if(k == 0) return ;
ans = ans - work(t[u]);
t[u] --;
ans = ans + work(t[u]);
}
int main()
{
n = read(); m = read();
for(re int i = 1; i <= n; i ++) a[i] = read();
for(re int i = 1; i <= m; i++)
{
q[i].l = read();
q[i].r = read();
q[i].num = i;
}
xsort = sqrt(n);
sort(q + 1, q + m + 1, mysort);
for(re int i = 1; i <= m; i++)
{
ll =q[i].l; rr = q[i].r;
while(p1 < ll){del(p1); p1 ++;}
while(p1 > ll){p1 --; add(p1);}
while(p2 < rr){p2 ++; add(p2);}
while(p2 > rr){del(p2); p2 --;}
cnt = (rr - ll + 1) * (rr - ll);
save1[q[i].num] = ans - (rr - ll + 1);
save2[q[i].num] = cnt;
}
for(re int i = 1; i <= m; i++)
{
if(save1[i] != 0 && save2[i] != 0) g = gcd(save1[i],save2[i]);
else g = 1;
if(save1[i] == 0 || save2[i] == 0) {printf("0/1
"); continue ;}
printf("%d/%d
",save1[i] / g,save2[i] / g);
}
return 0;
}
|