作业帮帮忙翻译一下,大概意思就行了
来源：学生作业帮 编辑：作业帮 分类：英语作业 时间：2024/05/18 21:03:40
帮忙翻译一下,大概意思就行了
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
别用金山翻译。。。翻译了也看不懂
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
别用金山翻译。。。翻译了也看不懂
说明
一种计量串列的“无序”程度的方式是,有关联的两个彼此呈无序状态的词条（entries 我不知道这样翻译行不）的对数.比如,在字符串“DAABEC”中,它的（无序）量度值是5,因为D比四个在他右边的字母都要大,然后E又比一个在其右边的字母大（解释一下,他这里的有序意思是按ABCD升序排列,如果降序就算无序,那么D在AABC前面就算四对无序entries了,加上EC就是舞对了）.这个计量就叫串列的反序组的数目.串列“AACEDGG”只有个反序组（E和D）——它几乎是按序排列的——但是串列“ZWQM”有6个反序组（它已经是它能达到的最无序的程度了——完全的反序）
你正在负责编录一个DNA链的串列(这个串列只包含4种字母A,C,G,T).但是呢,你你又不想将它们按字母的次序排列,而是按“最有序的”到“最无序的”的先后顺序排列成“有序列”.所有的（DNA）链都一样长.
输入
第一个段（用来记录DNA链的）包含两个整数（也就是说用两个整数来表示一个DNA链）：一个正整数n（0
一种计量串列的“无序”程度的方式是,有关联的两个彼此呈无序状态的词条（entries 我不知道这样翻译行不）的对数.比如,在字符串“DAABEC”中,它的（无序）量度值是5,因为D比四个在他右边的字母都要大,然后E又比一个在其右边的字母大（解释一下,他这里的有序意思是按ABCD升序排列,如果降序就算无序,那么D在AABC前面就算四对无序entries了,加上EC就是舞对了）.这个计量就叫串列的反序组的数目.串列“AACEDGG”只有个反序组（E和D）——它几乎是按序排列的——但是串列“ZWQM”有6个反序组（它已经是它能达到的最无序的程度了——完全的反序）
你正在负责编录一个DNA链的串列(这个串列只包含4种字母A,C,G,T).但是呢,你你又不想将它们按字母的次序排列,而是按“最有序的”到“最无序的”的先后顺序排列成“有序列”.所有的（DNA）链都一样长.
输入
第一个段（用来记录DNA链的）包含两个整数（也就是说用两个整数来表示一个DNA链）：一个正整数n（0