poj 1007 DNA Sorting

最新推荐文章于 2024-09-14 08:25:16 发布

weixin_33896069

最新推荐文章于 2024-09-14 08:25:16 发布

阅读量66

点赞数

文章标签： python

原文链接：https://my.oschina.net/locusxt/blog/178189

版权

2019独角兽企业重金招聘Python工程师标准>>>

由于题目特殊性,可以O(n)求逆序对数(思路来自poj.discuss). 据说用树状数组可以O(lg(n))...鉴于数据量小,冒泡水过.

DNA Sorting

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 76859		Accepted: 30791

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

Source

East Central North America 1998

[Submit] [Go Back] [Status] [Discuss]

Home Page

Go Back

To top

/*=============================================================================
#     FileName: dna_sorting.cpp
#         Desc: 
#       Author: zhuting
#        Email: cnjs.zhuting@gmail.com
#     HomePage: my.oschina.net/u/1053833
#      Version: 0.0.1
#   LastChange: 2013-11-22 00:25:49
#      History:
=============================================================================*/
#include <cstdio>
#include <cstdlib>
#include <string>
#include <cstring>
#define maxn 55
#define dna_maxn 105

/*dna结构, id其实是没用的,最后也没有使用.
 * rev是逆序对的个数.*/
struct dna
{
	int id, rev;
	char code[maxn];
};
dna d[dna_maxn];


void swap(dna &x, dna &y)
{
	int tmp = x.rev;
	x.rev = y.rev;
	y.rev = tmp;
	char chp_tmp[maxn];
	strcpy (chp_tmp, x.code);
	strcpy (x.code, y.code);
	strcpy (y.code, chp_tmp);
	return;
}


int main()
{
	int n = 0, m = 0;
	scanf ("%d%d", &n, &m);

	for (int i = 0; i < m; ++i)
	{
		scanf ("%s", d[i].code);

		/* 对于本题的特殊性,求逆序对可以实现O(n).
		 * x_count等记录的是以x为较大元素的逆序对的个数.
		 * 由于本题的元素仅仅只有4种,所以可以这样做.
		 * 从后向前扫一遍字符串,统计x_count的个数*/
		int a_count = 0, c_count = 0, g_count = 0, t_count = 0;
		int rev_sum = 0;
		for (int j = n - 1; j >= 0; --j)
		{
			switch(d[i].code[j])
			{
				case 'A':
					  ++c_count;
					  ++g_count;
					  ++t_count;
					  break;
				case 'C':
					  ++g_count;
					  ++t_count;
					  rev_sum += c_count;
					  break;
				case 'G':
					  ++t_count;
					  rev_sum += g_count;
					  break;
				case 'T':
					  rev_sum += t_count;
					  break;
				default:
					  break;
			}
		}
		d[i].rev = rev_sum;
	}
	
	/*鉴于本题的数据不够大,直接用冒泡.*/
	for (int i = 0; i < m; ++i)
	{
		for (int j = i; j < m; ++j)
		{
			if (d[i].rev > d[j].rev)
			{
				swap(d[i], d[j]);
			}
		}
	}

	for (int i = 0; i < m; ++i)
	{
		printf ("%s\n", d[i].code);
	}
	return 0;
}

转载于:https://my.oschina.net/locusxt/blog/178189