J - 归并排序求逆序对（POJ 1007）

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.

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

题解

题意：

• 给m个长度为n的包含ATCG的序列，按照逆序对个数降序输出这m个序列

思路：

• 数据结构，为了方便，就定义一个结构体，记录序列及其逆序对个数
• 可以在输入时，对每一个序列进行计数逆序对个数，最后按逆序对个数降序排序

Code

#include<iostream>
#include<string.h>
#include<algorithm>

using namespace std;

struct node
{
	char DNA[55];//dna串
	int inv;//逆序对数
}a[110];

int cmp(node x, node y)
{
    return x.inv < y.inv;
}

int main()
{
	int n,m,i,j,k;
	cin>>n>>m;
	for(i = 0; i < m; i++)
	{
		cin>>a[i].DNA;
		a[i].inv=0;
		for(j = 0; j < n; j++)
		{
			for(k = j; k < n; k++)
			    if(a[i].DNA[j] > a[i].DNA[k])
				    a[i].inv++;
		}
	}
    
    sort(a, a+m, cmp);

	for(i = 0; i < m; i++)
        cout<<a[i].DNA<<endl;
			
}