杭电1379DNA Sorting

DNA Sorting

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

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
  
  

 

Source

East Central North America 1998

题意：一个序列，它的值等于序列中每个字母右边比它小的字母的个数和，对于输入的几个序列，按照值从小到大排列，若值相同按照序列出现的先后排列

 

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct node{
int s,pos;
char str[110];
}num[55];
bool cmp(node a,node b)
{
if(a.s==b.s)
return a.pos<b.pos;
else 
return a.s<b.s;
}
int main()
{
int t,n,m,sum,i,j,k;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(i=0;i<m;i++)
{
sum=0;
scanf("%s",num[i].str);
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].pos=i;
num[i].s=sum;
}
for(i=0;i<m;i++)
sort(num,num+m,cmp);
for(i=0;i<m;i++)
printf("%s\n",num[i].str);
}
return 0;
}