若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1632: DNA Sorting

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,276

题目描述

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.

输入

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

样例输入

10 6
AACATGAAGG
TTTTGGCCAA
TTTGGCCAAA
GATCAGATTT
CCCGGGGGGA
ATCGATGCAT

样例输出

CCCGGGGGGA
AACATGAAGG
GATCAGATTT
ATCGATGCAT
TTTTGGCCAA
TTTGGCCAAA

参考代码

#include<stdio.h>
#include<string.h>
int main() 
{
    int n,m,i,j,s[105]={0},q,max=0;
    char a[200][200];
    scanf("%d%d",&n,&m);
    getchar();
    for (i=0; i<m; i++)
            gets(a[i]);
    for (i=0; i<m; i++) 
    {
        for (j=0; j<n; j++)
                    for (q=j+1; q<n; q++)
                        if(a[i][j]>a[i][q])
                            s[i]++;
        if(max<s[i])
                    max=s[i];
    }
    for (i=0; i<=max; i++)
            for (j=0; j<m; j++)
                if(s[j]==i)
                    puts(a[j]);
    return 0;
}

解析

暂无

hustoj

发表评论 取消回复

电子邮件地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

原站点 Dreams孤独患者 Skip
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist