# DNA Sorting

## Problem 62: DNA Sorting

Time Limit:1 Ms| Memory Limit:7 MB
Difficulty:1

## 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

i+1）统计（见代码）

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>

#define MAX 102

using namespace std;

typedef struct Elem
{
char tstr[MAX];
int num;                     //第几个
int nx;                      //逆序数
}elem;

elem data[MAX];
char str[MAX], temp[MAX];
int cnt = 0;

bool cmp(elem a, elem b)
{
if(a.nx != b.nx)                   //先按照逆序数排， 然后按输入顺序排
{
return a.nx < b.nx;
}
else
{
return a.num < b.num;
}
}

void merge(int left, int right)        //归并排序求逆序数
{
if(left >= right)
{
return;
}
int mid = (left + right)/2, i, j, k;
merge(left, mid);
merge(mid+1, right);
i = left, j = mid+1, k = left;
while(i <= mid && j <= right)
{
if(str[i] <= str[j])
{
temp[k++] = str[i++];
}
else
{
cnt += (mid - i + 1);             //temp[i] > temp[j]， 则i~mid 都大于temp[i], 逆序数+=(mid - i + 1)， 注意此处+1
temp[k++] = str[j++];
}
}
while(i <= mid)
{
temp[k++] = str[i++];
}
while(j <= right)
{
temp[k++] = str[j++];
}
for(i = left; i <= right; i++)
{
str[i] = temp[i];
}
}

int main()
{
int len, m, i;
scanf("%d%d", &len, &m);
for(i = 0; i < m; i++)
{
scanf("%s", data[i].tstr);              //录入数据， 并刷新data数组
strcpy(str, data[i].tstr);
cnt = 0;
merge(0, len-1);
data[i].num = i;
data[i].nx = cnt;
//        printf("%d\n", cnt);
}
sort(data, data + m, cmp);
for(i = 0; i < m; i++)
{
printf("%s\n", data[i].tstr);           //打印结果
}
return 0;
}


• 本文已收录于以下专栏：

## POJ-1007:DNA Sorting

1007:DNA Sorting 时间限制:  1000ms  内存限制:  65536kB 描述 One measure of unsortedness'' in...
• theprinceofelf
• 2012年01月17日 22:48
• 3195

## POJ_1007：DNA Sorting解题报告

• ljiabin
• 2014年08月21日 15:44
• 1036

## 每天一道算法_8_DNA Sorting

Description One measure of unsortedness'' in a sequence is the number of pairs of entries that are...
• jason0539
• 2013年10月30日 17:37
• 2640

## POJ1007-DNA Sorting

• lyy289065406
• 2011年07月30日 21:10
• 8770

## DNA逆序对的问题： DNA sorting

DNA　Sorting One measure of unsortedness'' in a sequence is the number of pairs of entries tha...
• a130737
• 2015年03月23日 13:54
• 530

## HDOJ DNA Sorting（第一周）

DNA Sorting Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other) Total ...
• helloiamclh
• 2015年07月27日 08:38
• 143

## DNA Sorting

DNA Sorting
• a997930294
• 2013年11月17日 15:54
• 973

## 1007 DNA Sorting（字符串+逆序数）

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 93936   Accepted: 377...
• liangzhaoyang1
• 2016年04月06日 22:17
• 632

## poj1007——DNA Sorting

Description One measure of unsortedness'' in a sequence is the number of pairs of entries that a...
• blue_skyrim
• 2015年08月24日 15:53
• 736

## Pku acm 1007 DNA Sorting 排序算法解题报告(五)----求逆序数 排序

• china8848
• 2008年03月29日 00:45
• 3840

举报原因： 您举报文章：DNA Sorting 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)