CF938E Max History
对于每一个 \(a_i\),若有 \(k\) 个比他小的数,那么他记录的次数即:
\[\begin{aligned}
&\sum_{i=0}^{k-1}\binom{i}{k-1}\times i!\times(n-i-1)!\\
=&\sum_{i=0}^{k-1}\dfrac{(k-1)!}{(k-i-1)!}\times(n-i-1)!\\
=&(k-1)!\sum_{i=0}^{k-1}\dfrac{n-1-i}{k-1-i}(n-k)!\\
=&(k-1)!(n-k)!\binom{n}{k-1}\\
=&\dfrac{n!}{n-k}
\end{aligned}\]
求和,做完了
本文来自博客园,作者:{Chthologist7507},转载请注明原文链接:https://www.cnblogs.com/Chthologist7507/articles/16777272.html

浙公网安备 33010602011771号