zoj_1188 DNA Sorting

最新推荐文章于 2020-07-13 19:37:36 发布

FlyingPiggy-MissW

最新推荐文章于 2020-07-13 19:37:36 发布

阅读量443

点赞数

分类专栏： ACM_实战题文章标签： sort vector 字符串排序

本文链接：https://blog.csdn.net/u010625743/article/details/44133421

版权

该问题要求对一系列等长的DNA字符串进行排序，不是按照字母顺序，而是根据字符串的“排序度”，从最高到最低。排序度由字符串中字符与其右侧字符逆序对的数量决定。如果逆序对数量相同，则保持原始输入顺序。题目提供了输入输出样例，并指出可以使用自定义排序函数解决此问题。

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

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 (sequences containing only the four letters A, C, G, and T). However, you want to catalog them, not in alphabetical order, but rather in order of ``sortedness'', from ``most sorted'' to ``least sorted''. All the strings are of the same length.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by