有关“逆序个数问题”的算法设计与分析报告.docVIP

逆序个数问题算法研究 秦韬，全昱立，薛梅，李丽萍 (陕西师范大学 计算机科学学院，陕西 西安 710119) 摘 要: n个元素组成的a[1],a[2],…,a[n]。若i〈j且a[i]〉a[j]则称 （a[i],a[j]）是一个逆序对。中逆序对的个数称为的逆序数。按定义计算逆序数要通过n（n-1）/2此次比较,时间复杂度是 O（n2）。一种方法利用树状数组计算逆序数,时间复杂度降为O（nlog2（n））。计算逆序数时间复杂度降为O（nlog2（n））主要思路是将元素从大到小依次放置在数状数组中对于每一个元素i来说因它前面的数比它大而计算出逆序数t[i]利用树状数组的结构特征即可以O（log2（n））的时间复杂度而统计出t[i]那么最终总的逆序数为∑t[i], XUE Mei, LI Li-ping (Dept. of 2013, School of Computer Science, Shaanxi Normal University, Xi’an 710119, China) Abstract: Sequence consisting of n elements, a [1], a [2], ..., a [n]. If i j and a [i] a [j], called (a [i], a [j]) is a reverse pair, or troublemakers on. Sequence in reverse order of the number called reverse number sequence. First, by definition violent methods to solve, count the number of reverse through n (n-1) / 2 the comparison, the time complexity is O (n2). Secondly, for a method of optimizing the use of computing the inverse number Binary Indexed Tree, the time complexity is reduced to O (nlog2 (n)). Finally, calculated according to the partition number reverse merge sort algorithm, the time complexity is reduced to O (nlog2 (n)). Sort Binary Indexed Tree optimization main idea is to be placed in decreasing order of the number of elements like array, for each element i, the result of its previous number larger than it calculated the number of reverse t [i], the use of characteristics Binary Indexed Tree structure, that can be O (log2 (n)) time complexity and the statistics t [i], then the final total number of reverse Σt [i]. The final optimization is the use of divide and conquer approach, through compromise to reduce complexity. Key words: Inverse number; Binary Indexed Tree; Divide and conquer merge; Algorithm 1 引言 逆序个数问题的描述： 多人排成一个队列,我们认为从低到高是正确的序列,但是总有部分人不遵守秩序。如果说,前面的人比后面的人高(两人身高一样认为是合适的),那么我们就认为这两个人是一对“捣乱分子”,比如说,现在存在一个序列:176, 178, 180, 170, 171这些捣乱分子对为176, 170, 176, 171, 178, 170, 178, 171, 180, 170, 180, 171,?那么,现在给出一个整型序列,请找出这些捣乱分子对的个数(仅给出捣乱分子对的数目即可,不用具体的对) 输入:为一个文件(in)，文件的每一行为一个序列。序列全为数字，数字间用”,”分