Desription
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.
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
求逆序数.将每个字符串的逆序数和字符串用结构体保存,再对逆序数排序
代码
#include<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
#include<vector>
#include<stdio.h>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
struct node
{
char s[55];
int v;
};
node w[105];
int n,m;
int nx(char x[])
{
int a[4],ans=0;
memset(a,0,sizeof(a));
for(int i=0;i<m;++i)
{
if(x[i]=='A')
ans+=a[1]+a[2]+a[3],++a[0];
else if(x[i]=='C')
ans+=a[2]+a[3],++a[1];
else if(x[i]=='G')
ans+=a[3],++a[2];
else
++a[3];
}
return ans;
}
bool cmp(node a,node b)
{
return a.v<b.v;
}
int main()
{
while(~scanf("%d %d",&m,&n)&&n)
{
char en[55];
for(int i=0;i<n;++i)
{
scanf("%s",en);
strcpy(w[i].s,en);
w[i].v=nx(en);
}
sort(w,w+n,cmp);
for(int i=0;i<n;++i)
printf("%s\n",w[i].s);
}
}