poj 1007 DNA Sorting
来源:互联网 发布:arduino读取串口数据 编辑:程序博客网 时间:2024/05/17 09:30
**
DNA Sorting
**
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
代码:
#include<iostream>#include<string>using namespace std;int main(){ int n, m, min,t,i,j,h,flag[100]; string s[100],str; cin >> n >> m; for (i = 0; i < m; i++) { cin >> s[i]; flag[i] = 0; for (j = 0; j < n-1; j++) { for (h = j + 1; h< n; h++) { if (s[i][j] > s[i][h]) flag[i]++; } } } for (i = 0; i < m-1; i++) { min = i; for (j = i + 1; j < m; j++) { if (flag[min]>flag[j]||(flag[min]==flag[j]&&s[min]>s[j])) min = j; } t = flag[i]; flag[i] = flag[min]; flag[min] = t; str = s[i]; s[i] = s[min]; s[min] = str; } for (i = 0; i < m; i++) cout << s[i] << endl; return 0;}
- POJ 1007 DNA Sorting
- poj 1007 DNA Sorting
- POJ 1007 DNA Sorting
- POJ-1007 DNA Sorting
- 【POJ】1007 DNA Sorting
- POJ-1007:DNA Sorting
- poj 1007 DNA Sorting
- POJ 1007 DNA Sorting
- POJ 1007 DNA Sorting
- poj 1007 DNA Sorting
- POJ 1007 DNA Sorting
- 【POJ】1007 DNA Sorting
- poj 1007 DNA sorting
- POJ 1007 DNA Sorting
- poj 1007 DNA Sorting
- [POJ][1007]DNA Sorting
- POJ 1007 DNA Sorting
- poj 1007 DNA sorting
- 专题四 Problem M
- 提交表单数据到新打开的页面中
- Web前端和后端区别
- [坚果原创]教你使用Arduino制作一个微型MUD聊天机器
- 数据库基础篇(三)通过EF实现与MySql数据库的连接
- poj 1007 DNA Sorting
- Linux下jdk的安装与配置
- textview设置超出规定的长度时显示省略号
- java怎样调用别的类的静态方法
- docker文件互传
- NYOJ 82:迷宫寻宝(一)(BFS)
- TP问题汇总
- IT人生 需要指引
- java.lang.ArithmeticException