zoj1201--------Inversion

最新推荐文章于 2022-05-08 18:12:09 发布

原创

最新推荐文章于 2022-05-08 18:12:09 发布 · 1k 阅读

该博客介绍了ZOJ1201题目中关于Inversion的概念，通过样例输出解析了P规则和I规则。P规则是将原数组中每个数按其前面大于它的数的个数进行重新排列；I规则则是构建一个初始全为0的数组，根据原数组中每个数前面0的个数进行填充。博主提供了实现这两种规则的代码解析。

Let { A1,A2,...,An } be a permutation of the set{ 1,2,..., n}. If i < j and Ai > Aj then the pair (Ai,Aj) is called an "inversion" of the permutation. For example, the permutation {3, 1, 4, 2} has three inversions: (3,1), (3,2) and (4,2).
The inversion table B1,B2,...,Bn of the permutation { A1,A2,...,An } is obtained by letting Bj be the number of elements to the left of j that are greater than j. (In other words, Bj is the number of inversions whose second component is j.) For example, the permutation:
{ 5,9,1,8,2,6,4,7,3 }
has the inversion table
2 3 6 4 0 2 2 1 0
since there are 2 numbers, 5 and 9, to the left of 1; 3 numbers, 5, 9 and 8, to the left of 2; etc.
Perhaps the most important fact about inversions is Marshall Hall's observation that an inversion table uniquely determines the corresponding permutation. So your task is to convert a permutation to its inversion table, or vise versa, to convert from an inversion ta