题目:
随机生成
1
∼
n
1\sim n
1∼n的排列,求逆序数的期望。
思路:
f
(
i
,
j
)
f(i,j)
f(i,j)表示
i
,
j
i,j
i,j对排列的逆序数产生的贡献,则逆序数
X
=
∑
i
,
j
f
(
i
,
j
)
X=\sum_{i,j}f(i,j)
X=∑i,jf(i,j)
E
(
X
)
=
E
(
∑
i
,
j
f
(
i
,
j
)
)
=
∑
i
,
j
E
(
f
(
i
,
j
)
)
=
∑
i
,
j
1
2
=
n
(
n
−
1
)
4
\begin{aligned} E(X)&=E(\sum_{i,j}f(i,j))\\ &=\sum_{i,j}E(f(i,j))\\ &=\sum_{i,j}\frac{1}{2}\\ &=\frac{n(n-1)}{4} \end{aligned}
E(X)=E(i,j∑f(i,j))=i,j∑E(f(i,j))=i,j∑21=4n(n−1)