hdoj 1376 DNA Sorting

DNA Sorting

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

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
ATCGAT
   
   GCAT
  
  

 

Sample Output

  
  

   
   CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA
  
  
  
  


  
  
  
  


  
  
  
  

   
   思路：对每一个字符串中的从第一个字符开始找比它小的字符，并记录总数量，
  
  
  
  

   
   比如：
   
   AACATG：有 CA,TC 2个；
  
  
  
  

   
        TAGAGA：有 TA,TG,TA,TG,TA,GA,GA,GA 8中；
  
  
  
  

   
   最后对所有字符串对应的数量进行从小到大排序，如果数量相等则按照原输入顺序排序；最后输出字符串。
  
  
  
  

   
   

  
  
  
  

   
   

  
  
  
  

   
   代码：
  
  
  
  

   
   

  
  
  
  

   
   
   
   
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<algorithm>
using namespace std;
struct record
{
	char str[1000];
	int amo,loc;
}num[1000];
bool cmp(record a,record b)
{
	if(a.amo!=b.amo)
	return a.amo<b.amo;
	else
	return a.loc<b.loc;
}
int main()
{
	int t,n,m,i,j,k,sum;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&m);
		for(i=0;i<m;i++)
		{
			scanf("%s",num[i].str);
			sum=0;
			for(j=0;j<n;j++)
			{
				for(k=j+1;k<n;k++)
				{
					if(num[i].str[j]>num[i].str[k])
					{
						sum++;
					}
				}
			}
			num[i].amo=sum;
			num[i].loc=j;
		}
		sort(num,num+m,cmp);
		for(i=0;i<m;i++)
		{
			printf("%s\n",num[i].str);
		}
	}
	return 0;
}