DNA Sorting
Time Limit: 1000MS |
| Memory Limit: 10000K |
Total Submissions: 89848 |
| Accepted: 36105 |
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.
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
Sample Output
CCCGGGGGGA AACATGAAGG GATCAGATTT ATCGATGCAT TTTTGGCCAA TTTGGCCAAA
Source
思路:
在输入的过程中,对输入的字符串求逆序数(遍历所有的字符,再遍历每个字符前面有多少个比那个字符大的字符,然后遍历完所有的字符之后,将对应的逆序数的值赋值给p[i].num,),然后对结构体进行sort排序,把字符串按照题意输出
代码:
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
struct node
{
char a[55];
int num;
}p[105];
int n,m;
int cmp(node u,node v)
{
return u.num<v.num;
}
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=1;i<=m;i++)
{
scanf("%s",p[i].a+1);
int cnt=0;
for(int j=1;j<=n;j++)//遍历所有的字符,求逆序数
{
for(int k=1;k<j;k++)
{
if(p[i].a[k]>p[i].a[j])
cnt++;//保存逆序数
}
}
p[i].num=cnt;
}
sort(p+1,p+m+1,cmp);//对逆序数按照从小到大的顺序进行排序!
for(int i=1;i<=m;i++)//输出字符串
{
printf("%s\n",p[i].a+1);//记住这一点要加1,因为你输入的时候就是这样输入的!
}
}
return 0;
}