杭电OJ题 1379 DNA Sorting解题报告

DNA Sorting

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 1398    Accepted Submission(s): 680

Problem 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.


This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

 

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 (1 < 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''. If two or more strings are equally sorted, list them in the same order they are in the input file.

 

Sample Input

  
  

   
   1

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT
  
  

 

Sample Output

  
  

   
   CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA
  
  

 
——————————————————————————————————————
其实就是一趟排序，排序依据是每个字符串的已排序度，按已排序度的升序对字符串排序，当已排序度一样的时候按照原始数据的先后顺序输出，即要求稳定的排序算法，我用最简单的冒泡排序。

/****************************
 *Name:DNA Sorting.c
 *Tags:ACM water
 ****************************/

#include <stdio.h>

struct string {
      char s[51];
      int measure;
};

int main()
{
      int N, n, m, i, j, t;
      struct string str[100], temp;
      scanf("%d", &N);
      getchar();
      getchar();
      while(N--) {
	    scanf("%d%d", &n, &m);
	    getchar();
	    for(i = 0; i < m; i++) {
		  gets(str[i].s);
		  str[i].measure = 0;
		  for(j = 0; j < n-1; j++) {
			for(t = j+1; t < n; t++) {
			      if(str[i].s[j] > str[i].s[t]) {
				    str[i].measure += 1;
			      }
			}
		  }
	    }
	    for(i = 0; i < m-1; i++) {
		  for(j = 0; j < m - i - 1; j++) {
			if(str[j].measure > str[j+1].measure) {
			      temp = str[j];
			      str[j] = str[j+1];
			      str[j+1] = temp;
			}
		  }
	    }
	    for(i = 0; i < m; i++) {
		  printf("%s\n", str[i].s);
	    }
	    if(N) {
		  printf("\n");
	    }
      }
      return 0;
}