此满二叉树共有
k
k
k 层(根节点在第
k
k
k 层,叶子节点在第
1
1
1 层)
记当前节点
c
c
c 在第
m
m
m 层,
c
c
c 的左子树中节点集合为
L
L
L,右子树中节点集合为
R
R
R,则:
L
C
A
(
i
,
j
)
=
c
⟺
LCA(i,j) =c\iff
LCA(i,j)=c⟺
①
i
∈
L
,
j
∈
R
i\in L\ ,j\in R
i∈L ,j∈R
②
i
=
c
,
j
∈
L
i=c\ ,j\in L
i=c ,j∈L
③
i
=
c
,
j
∈
R
i=c\ ,j\in R
i=c ,j∈R
④
i
=
c
,
j
=
c
i=c\ ,j=c
i=c ,j=c
⑥~⑧:①~③ 交换
i
,
j
i, j
i,j
每种情况的数量为:
①
(
2
m
−
1
−
1
)
2
=
2
2
m
−
2
+
1
−
2
m
(2^{m-1}-1)^2=2^{2m-2}+1-2^m
(2m−1−1)2=22m−2+1−2m
②
2
m
−
1
−
1
2^{m-1}-1
2m−1−1
③
2
m
−
1
−
1
2^{m-1}-1
2m−1−1
④
1
1
1
⑥~⑧:同 ①~③
显然与 c c c 同一层(第 m m m 层)的节点都有这一结论,将以上各项相加,记为 f a c t o r m factor_m factorm:
f a c t o r m = 2 2 m − 1 − 1 factor_m=2^{2m-1}-1 factorm=22m−1−1
记第
i
i
i 层所有元素之和为
l
a
y
e
r
i
layer_i
layeri
记
i
i
i 层高的满二叉树所有元素之和为
Δ
i
\Delta_i
Δi
则:
Δ
k
=
∑
i
=
1
k
l
a
y
e
r
i
\Delta_k=\sum_{i=1}^klayer_i
Δk=∑i=1klayeri
以三层满二叉树为例:
Δ
3
=
l
a
y
e
r
1
+
l
a
y
e
r
2
+
l
a
y
e
r
3
\Delta_3=layer_1+layer_2+layer_3
Δ3=layer1+layer2+layer3
于是:
∑ i = 1 n ∑ j = 1 n L C A ( i , j ) \sum_{i=1}^n\sum_{j=1}^nLCA(i,j) ∑i=1n∑j=1nLCA(i,j)
= ∑ i = 1 k l a y e r i × f a c t o r i =\sum_{i=1}^klayer_i \times factor_{i} =∑i=1klayeri×factori
由前述,关于
l
a
y
e
r
layer
layer 的求和,我们可以转换为关于
Δ
\Delta
Δ 的求和:
(此图只为说明求和视角转换,不是此题中的真实系数)
=
∑
i
=
1
k
l
a
y
e
r
i
×
2
2
i
−
1
−
∑
i
=
1
k
l
a
y
e
r
i
=\color{#FF8C00}\sum_{i=1}^{k}layer_i\times2^{2i-1}\color{#3CB371}-\sum_{i=1}^{k}layer_i
=∑i=1klayeri×22i−1−∑i=1klayeri
= 2 Δ k + ∑ i = 2 k Δ k − i + 1 × 3 4 × 2 2 i − 1 − Δ k =\color{#FF8C00}2\Delta_k+\color{#FF8C00}\sum_{i=2}^{k}\Delta_{k-i+1}\times\frac{3}{4}\times2^{2i-1}\color{#3CB371}-\Delta_k =2Δk+∑i=2kΔk−i+1×43×22i−1−Δk
= 3 ∑ i = 2 k Δ k − i + 1 × 2 2 i − 3 + Δ k =3\sum_{i=2}^{k}\Delta_{k-i+1}\times2^{2i-3}+\Delta_k =3∑i=2kΔk−i+1×22i−3+Δk
其中:
Δ
k
=
∑
i
=
1
2
k
−
1
i
=
2
k
×
(
2
k
−
1
)
2
=
2
2
k
−
1
−
2
k
−
1
\Delta_k=\sum_{i=1}^{2^k-1}i=\frac{2^k\times(2^k-1)}{2}=2^{2k-1}-2^{k-1}
Δk=∑i=12k−1i=22k×(2k−1)=22k−1−2k−1
Δ k − i + 1 = 2 2 ( k − i + 1 ) − 1 − 2 k − i + 1 − 1 = 2 2 k − 2 i + 1 − 2 k − i \Delta_{k-i+1}=2^{2(k-i+1)-1}-2^{k-i+1-1}=2^{2k-2i+1}-2^{k-i} Δk−i+1=22(k−i+1)−1−2k−i+1−1=22k−2i+1−2k−i
于是原式 = 3 ( ∑ i = 2 k 2 2 k − 2 − ∑ i = 2 k 2 k + i − 3 ) + 2 2 k − 1 − 2 k − 1 =3(\sum_{i=2}^{k}2^{2k-2}-\sum_{i=2}^{k}2^{k+i-3})+2^{2k-1}-2^{k-1} =3(∑i=2k22k−2−∑i=2k2k+i−3)+22k−1−2k−1
= 3 ( k − 1 ) × 2 2 k − 2 − 3 × ( 2 2 k − 2 − 2 k − 1 ) + 2 2 k − 1 − 2 k − 1 =3(k-1)\times2^{2k-2}-3\times(2^{2k-2}-2^{k-1})+2^{2k-1}-2^{k-1} =3(k−1)×22k−2−3×(22k−2−2k−1)+22k−1−2k−1
= ( 3 k − 4 ) × 2 2 k − 2 + 2 k =(3k-4)\times2^{2k-2}+2^{k} =(3k−4)×22k−2+2k
#include <stdio.h>
using namespace std;
long long m = 998244353;
long long pow2[2000002];
inline void f1(int k)
{
long long a = 3 * k - 4;
long long b = pow2[2 * k - 2];
long long c = pow2[k];
printf("%lld\n", (a * b % m + c) % m);
}
int main()
{
pow2[0] = 1;
for (int i = 1; i < 2000002; i++)
pow2[i] = pow2[i - 1] * 2 % m;
int t;
scanf("%d", &t);
for (int i = 0; i < t; i++)
{
int k;
scanf("%d", &k);
f1(k);
}
return 0;
}
![](https://i-blog.csdnimg.cn/blog_migrate/48d2ec27c10b97b0947c1d33873c3ae8.png)
![](https://i-blog.csdnimg.cn/blog_migrate/79ca79d2170e336976b555b29c49d15a.png)
![](https://i-blog.csdnimg.cn/blog_migrate/a39fdc6d5b92c03b99b76ca6ce779575.png)