poj 1007分析和总结分析和总结.docx

通过率：39% 难度：较难 DNA Sorting Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 46899 Accepted: 18311 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 (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. Input The first line contains two integers: a positive integer n (0 n = 50) giving the length of the strings; and a positive integer m (0 m = 100) giving the number of strings. These are followed by m lines, each containing a string of length n. Output Output the list of input strings, arranged from ``most sorted to ``least sorted. Since two strings can be equally sorted, then output them according to the orginal order. Sample Input 10 6 AACATGAAGG TTTTGGCCAA TTTGGCCAAA GATCAGATTT CCCGGGGGGA ATCGATGCAT CCCGGGGGGA AACATGAAGG GATCAGATTT ATCGATGCAT TTTTGGCCAA TTTGGCCAAA 翻译：给出几条 DNA 序列，序列中只包含“A”，“C”,“T”,“G”，要求若序列中任意一个字母，在它后面只要有一个小于它的字母，则记一个染色体倒置，将输入的DNA 序列按各自染色体倒置的总数从小到大排序输出，其中要求 DNA 条数要在 0 到 100 之间，DNA 序列的长度即包含的字母个数要在 0 到 50 之间，若有两条 DNA 的倒置总数一样，则将这两条DNA 原序输出 解题思路： 对每一条 DNA 对应一个变量，对它的的第i 个字母，将第 i 个字母之后的每个字母依次与第i 个字母比较，若小于则变量值加(i 可取DNA 的第一个字母到倒数第二个字母进行循环)， 然后将每一条DNA 对应的变量值进行比较，从第一个开始，若后面某个变量值大于它则将它们对应的字符串（即 DNA 序列）相互交换，如此循环，最后将DNA 序列按顺序输出就是按要求排好的一条一条的DNA 序列 总结及出错情况： 题目要求是要输入 DNA 条数和每条 DNA 的长度，在定义字符串数组的时候易出现拥变量定义数组的行和列的情况，导致编译错