This blog discusses the Kleene Inversion problem from AtCoder, detailing the problem statement, constraints, and providing an analysis of the solution. The author explains how to calculate the inversion number of a concatenated sequence, considering pairs of integers and modulo arithmetic."
137868606,5604553,Python基础实践：函数与算法挑战,"['Python', '开发语言', '算法']
See the original article https://dyingdown.github.io/2019/11/22/AtCoder-5165-Kleene-Inversion/
Kleene Inversion
Problem Statement
We have a sequence of N integers A = A 0 , A 1 , ⋯ , A N − 1 A~=~ A_0,~A_1,~ \cdots,~A_{N−1} A = A0, A1, ⋯, AN−1.
Let B be a sequence of K × N K \times N K×N integers obtained by concatenating K K K copies of A A A. For example, if A = 1 , 3 , 2 A ~=~1,~3,~2 A = 1, 3, 2 and K = 2 , B = 1 , 3 , 2 , 1 , 3 , 2 K ~=~2, B~=~1,~3,~2,~1,~3,~2 K = 2,B = 1, 3, 2, 1, 3, 2.
Find the inversion number of B, modulo 1 0 9 + 7 10^9+7 109+7.
Here the inversion number of B is defined as the number of ordered pairs of integers ( i , j ) ( 0 ≤ i < j ≤ K × N − 1 ) (i,~j)~(0≤i<j≤K \times N−1) (i,
最低0.47元/天 解锁文章
扫一扫
180
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
