hdu 1379 DNA Sorting

最新推荐文章于 2020-03-27 11:22:34 发布

原创最新推荐文章于 2020-03-27 11:22:34 发布 · 774 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

ACM_排序

本文探讨了如何利用排序算法对DNA序列进行排序，从最有序到最混乱，揭示了生物信息学中排序程度的概念及其在基因排序中的实际应用。

题目地址：

http://acm.hdu.edu.cn/showproblem.php?pid=1379

题目描述：

DNA Sorting

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

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

题意：

有一个排序程度的定义，排序程度 = 每个字符大于右边字符情况的和，然后根据排序程度越小和本来输入位置越靠前而在最终排序中靠前的这个规则来排序。

题解：

排序。

代码：

#include<stdio.h>
#include<algorithm>
using namespace std;
typedef struct dna
{
    char str[55];
    int ranks;
    int sorts;
}dna,* dna_link;
dna dd[100];
int n=0,m=0,t=0;
bool comp(dna a, dna b)
{
    if(a.sorts < b.sorts) return true;
    else if(a.sorts > b.sorts) return false;
    else return a.ranks < b.ranks;
}
int main()
{
    while(scanf("%d",&t)!=EOF)
    {
        int cases=0;
        while(t--)
        {
            cases++;
            scanf("%d%d",&n,&m);
            for(int i=0;i<m;i++)
            {
                scanf("%s",dd[i].str);
                dd[i].ranks=i;
                dd[i].sorts=0;//initialize
                for(int k1=0;k1<n;k1++)
                {
                    for(int k2=k1+1;k2<n;k2++)
                    {
                        if(dd[i].str[k1]>dd[i].str[k2]) dd[i].sorts++;
                    }
                }
            }
            sort(dd,dd+m,comp);
            for(int i=0;i<m;i++) printf("%s\n",dd[i].str);
            if(cases>1) printf("\n");
        }
    }
    return(0);
}

标签

#sort