POJ1007-DNA Sorting

s0i1

于 2019-04-16 22:25:47 发布

阅读量531

点赞数

分类专栏： c/c++

本文链接：https://blog.csdn.net/changer_WE/article/details/89034836

版权

该博客讨论了如何对DNA字符串进行排序，根据"unsortedness"度量标准，即序列中逆序对的数量。输入包含字符串长度n和数量m，输出是按排序度从高到低排列的DNA序列，相同排序度则按原始顺序排列。

摘要由CSDN通过智能技术生成

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 112218		Accepted: 44884

Description

One measure of ``unsortedness'' in a sequence is the number of pairs of entries that are out of order with respect to each other. For instance, in the letter sequence ``DAABEC'', this measure is 5, since D is greater than four letters to its right and E is greater than one letter to its right. This measure is called the number of inversions in the sequence. The sequence ``AACEDGG'' has only one inversion (E and D)---it is nearly sorted---while the sequence ``ZWQM'' has 6 inversions (it is as unsorted as can be---exactly the reverse of sorted).

You are responsible for cataloguing a sequence of DNA strings