poj 1007 DNA sorting

原创 2013年12月05日 10:43:09

DNA Sorting
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 77160   Accepted: 30918

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


大致题意:给定长度为n,m个字符串,根据字母表顺序,来比较每个字符串的逆序数,根据逆序数从小到大输出

排好序的字符串,如果有些字符串逆序数相同,按照以前给定字符串的顺序输出。


poj的数据可能有问题,我用sort竟然也过了。


解题思路:其实就是求逆序数并进行字符串排序,关键点在于如何排序,如果逆第一时间想到sort或者qsort,

那么恭喜你打错了,题目要求按原给定顺序输出,实际就是稳定排序,可以使用冒泡或者STL的stable_sort()

进行排序,两者都是稳定排序。

看到网上介绍几种排序:引用网址:稳定排序和不稳定排序

1.稳定的:冒泡,插入,归并,基数。

2不稳定的:快速,选择,希尔,堆排序。


#include <stdio.h>
#include <algorithm>
using namespace std;

struct Node
{
    char str[52];
    int count;
};

bool mycmp(Node a, Node b)
{
	return a.count < b.count;
}

Node dna[102];

int getRev(char s[], int n)
{
    int i, j, cnt = 0, tmp;
    for (i=0; i<n-1; ++i)
    {
        tmp = 0;
        for (j=i+1; j<n; ++j)
        {
            if (s[i] > s[j])
                tmp++;
        }
        cnt += tmp;
    }
    return cnt;
}

int main()
{
    int n, m, i, j;
    Node t;
    scanf("%d %d", &n, &m);
    for (i=0; i<m; ++i)
    {
        scanf("%s", dna[i].str);
        dna[i].count = getRev(dna[i].str, n);
    }
    
/*	
	// 冒泡排序也是稳定排序
	for (i=0; i<m; ++i)
    {
        for (j=0; j<m-i-1; ++j)
        {
            if (dna[j].count > dna[j+1].count)
            {
                t = dna[j];
                dna[j] = dna[j+1];
                dna[j+1] = t;
            }
        }
    }
*/
    stable_sort(dna, dna+m, mycmp);	// STL stabel_sort(first, end ,cmpfunc) 稳定排序
    for (i=0; i<m; ++i)
        puts(dna[i].str);

    return 0;
}


每天一道算法_8_DNA Sorting

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

杭电OJ——1007 Quoit Design(最近点对问题)

Quoit Design Problem Description Have you ever played quoit in a playground? Quoit is a game in w...
  • lishuhuakai
  • lishuhuakai
  • 2013年06月24日 14:03
  • 7944

【unity小技巧之四】变量弹出SortingLayer选择面板

经常想在脚本中设置一个变量对应SortingLayer的某个层,然后赋值给SpriteRender修改排序层,但是unity官方似乎没有办法直接弹出SortingLayer面板进行选择,就像是Laye...
  • egostudio
  • egostudio
  • 2016年06月24日 11:28
  • 2401

poj 1007 DNA Sorting 【对逆序数进行sort排序】

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submission...
  • dxx_111
  • dxx_111
  • 2015年09月04日 15:18
  • 172

POJ - 1007 DNA Sorting

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 80800   A...
  • Jvc__
  • Jvc__
  • 2014年06月02日 18:30
  • 196

POJ1007-DNA Sorting-ACM

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 83442   A...
  • Skylv111
  • Skylv111
  • 2014年10月04日 17:56
  • 423

POJ1007-DNA Sorting

转载请注明出处:優YoU    http://user.qzone.qq.com/289065406/blog/1309425334   大致题意: 输入m个长度为n的DNA序列,把他们按照...
  • lyy289065406
  • lyy289065406
  • 2011年07月30日 21:10
  • 8704

POJ 1007 DNA Sorting 水

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 89587   Accepted: 360...
  • zp___waj
  • zp___waj
  • 2015年08月21日 18:26
  • 340

poj1007DNA Sorting

DNA Sorting Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 81639   A...
  • sibangde
  • sibangde
  • 2014年07月12日 12:01
  • 292

poj 1007 DNA Sorting(STL运用)

Description One measure of ``unsortedness'' in a sequence is the number of pairs of entries that ar...
  • ShiWaiGaoRen12345
  • ShiWaiGaoRen12345
  • 2016年07月21日 16:15
  • 242
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:poj 1007 DNA sorting
举报原因:
原因补充:

(最多只允许输入30个字)