题目链接:https://www.luogu.org/problem/P5268
思路:对于只查询不修改,而且查询有关元素出现次数的要求,我们要用莫队做,但是莫队是用来处理一类双端点询问,所以我们要把式子拆成四个双端点询问。
题目中原式是这样的:
∑
x
=
1
∞
get
(
l
1
,
r
1
,
x
)
∗
get
(
l
2
,
r
2
,
x
)
\large\sum\limits_{x=1}^\infty \text{get}(l_1,r_1,x)*\text{get}(l_2,r_2,x)
x=1∑∞get(l1,r1,x)∗get(l2,r2,x)
显然下面的式子成立:
get
(
l
,
r
,
x
)
=
get
(
1
,
r
,
x
)
−
get
(
1
,
l
−
1
,
x
)
\large \text{get}(l,r,x)=\text{get}(1,r,x)-\text{get}(1,l-1,x)
get(l,r,x)=get(1,r,x)−get(1,l−1,x)
为了方便表述,我们设:
g
(
i
,
x
)
=
get
(
1
,
i
,
x
)
\large g(i,x)=\text{get}(1,i,x)
g(i,x)=get(1,i,x)
那么原式可化为:
∑
x
=
1
∞
(
g
(
r
1
,
x
)
−
g
(
l
1
−
1
,
x
)
)
(
g
(
r
2
,
x
)
−
g
(
l
2
−
1
,
x
)
)
\large\sum\limits_{x=1}^\infty (\text{g}(r_1,x)-\text{g}(l_1-1,x))(\text{g}(r_2,x)-\text{g}(l_2-1,x))
x=1∑∞(g(r1,x)−g(l1−1,x))(g(r2,x)−g(l2−1,x))
所以原式就化为了:
∑
x
=
1
∞
g
(
r
1
,
x
)
g
(
r
2
,
x
)
−
g
(
r
1
,
x
)
g
(
l
2
−
1
,
x
)
−
g
(
l
1
−
1
,
x
)
g
(
r
2
,
x
)
+
g
(
l
1
−
1
,
x
)
g
(
l
2
−
1
,
x
)
\large\sum\limits_{x=1}^\infty g(r_1,x)g(r_2,x)-g(r_1,x)g(l_2-1,x)-g(l_1-1,x)g(r_2,x)+g(l_1-1,x)g(l_2-1,x)
x=1∑∞g(r1,x)g(r2,x)−g(r1,x)g(l2−1,x)−g(l1−1,x)g(r2,x)+g(l1−1,x)g(l2−1,x)
然后就将其拆成
4
4
4个询问
q
1
=
∑
x
=
1
∞
g
(
r
1
,
x
)
g
(
r
2
,
x
)
\large q_1=\sum\limits_{x=1}^\infty g(r_1,x)g(r_2,x)
q1=x=1∑∞g(r1,x)g(r2,x)
q
2
=
∑
x
=
1
∞
g
(
r
1
,
x
)
g
(
l
2
−
1
,
x
)
\large q_2=\sum\limits_{x=1}^\infty g(r_1,x)g(l_2-1,x)
q2=x=1∑∞g(r1,x)g(l2−1,x)
q
3
=
∑
x
=
1
∞
g
(
l
1
−
1
,
x
)
g
(
r
2
,
x
)
\large q_3=\sum\limits_{x=1}^\infty g(l_1-1,x)g(r_2,x)
q3=x=1∑∞g(l1−1,x)g(r2,x)
q
4
=
∑
x
=
1
∞
g
(
l
1
−
1
,
x
)
g
(
l
2
−
1
,
x
)
\large q_4=\sum\limits_{x=1}^\infty g(l_1-1,x)g(l_2-1,x)
q4=x=1∑∞g(l1−1,x)g(l2−1,x)
然后询问的实际答案就是
q
1
−
q
2
−
q
3
+
q
4
q_1-q_2-q_3+q_4
q1−q2−q3+q4
然后就能直接用莫队搞了,时间复杂度 O ( n 3 2 ) O(n^\frac{3}{2}) O(n23)。注意上面的 l l l 和 r r r 都是指的右端点。莫队维护的是两个式子相乘,所以用两个 c n t cnt cnt维护。
#include<bits/stdc++.h>
using namespace std;
const int N = 5e4 + 7;
int sum, cntl[N], cntr[N], ans[N], a[N], pos[N];
int n, m, block, cnt, l1, r1, l2, r2;
inline int read()
{
char ch = getchar(); int x = 0, f = 1;
while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
while('0' <= ch && ch <= '9') {x = x * 10 + ch - '0'; ch = getchar();}
return x * f;
}
struct node {int l, r, id, sign;} q[N * 4];
bool cmp(node a,node b) {return pos[a.l] == pos[b.l] ? a.r < b.r : a.l < b.l;}
inline void addl(int x) { ++cntl[x], sum += cntr[x];}
inline void dell(int x) { sum -= cntr[x], --cntl[x];}
inline void addr(int x) { ++cntr[x], sum += cntl[x];}
inline void delr(int x) { sum -= cntl[x], --cntr[x];}
int main()
{
n = read();
for(int i = 1; i <= n; i++) a[i] = read();
block = (int)sqrt(n); m = read();
for(int i = 1; i <= m; i++)
{
l1 = read(), r1 = read(), l2 =read(), r2 = read();
q[++cnt] = (node){r1, r2, i, 1};
q[++cnt] = (node){r1, l2-1, i, -1};
q[++cnt] = (node){l1-1, r2, i, -1};
q[++cnt] = (node){l1-1, l2-1, i, 1};
}
for(int i = 1; i <= n; i++) pos[i] = (int)(i - 1) / block + 1;
sort(q + 1, q + cnt + 1, cmp);
int l = 0, r = 0;
for(int i = 1; i <= cnt; i++)
{
while(l < q[i].l) addl(a[++l]);
while(l > q[i].l) dell(a[l--]);
while(r < q[i].r) addr(a[++r]);
while(r > q[i].r) delr(a[r--]);
ans[q[i].id] += sum * q[i].sign;
}
for(int i = 1; i <= m; i++) printf("%d\n",ans[i]);
return 0;
}
/*
5
1 1 1 1 1
2
1 2 3 4
1 1 4 4
*/