DNA Sorting
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2247 Accepted Submission(s): 1105
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.
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/* 题意:: 给一个 n行字符串,每行字符串有m个字符,要将每行的字符都按从小到大顺序排序,每次只能将 一个字符移动一格 ,将他们排好顺序,要进行的操作次数是不同的,将他们按照操作复杂度 从大到小输出字符串。 */ #include<stdio.h> #include<string.h> #include<algorithm> using namespace std; char s[110]; struct zz { int x; char s[110]; }q[110]; int cmp(zz x,zz y) { return x.x<y.x; } int main(){ int t,n,m,n1; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); n1=n; int i,j,k; for(i=0;i<m;i++) { scanf("%s",q[i].s); for(j=0;j<n1;j++) { for(k=0;k<n;k++) { if(q[i].s[k]>q[i].s[n-1]) { q[i].x++; } } n--; } n=n1; } sort(q,q+m,cmp); for(i=0;i<m;i++) printf("%s\n",q[i].s); } return 0; }