Problem 62: DNA Sorting(简单逆序数, 排序问题)
来源:互联网 发布:apache配置访问权限 编辑:程序博客网 时间:2024/05/19 03:28
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. InputThe 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.OutputOutput 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 InputSample Input10 6AACATGAAGGTTTTGGCCAATTTGGCCAAAGATCAGATTTCCCGGGGGGAATCGATGCATSample OutputCCCGGGGGGAAACATGAAGGGATCAGATTTATCGATGCATTTTTGGCCAATTTGGCCAAA
#include<iostream>#include <stdio.h>using namespace std;typedef struct { char square[100]; int n;} Sam;Sam a[100];int main(void) { int i, j, k, m, n; scanf("%d%d", &m, &n); getchar(); for(i=0; i<n; i++) { for(j=0; j<m; j++) scanf("%c",&a[i].square[j]); a[i].n = 0; getchar(); for(j=0; j<m-1; j++) { for(k=j+1; k<m; k++) { if(a[i].square[j] > a[i].square[k]) a[i].n += 1; } } } for(i=0; i<n-1; i++) { for(j=0; j<n-i-1; j++) { if(a[j].n > a[j+1].n) { Sam temp = a[j]; a[j] = a[j+1]; a[j+1] = temp; } } } for(i=0; i<n; i++) { for(j=0; j<m; j++) printf("%c", a[i].square[j]); puts(""); } return 0;}
- Problem 62: DNA Sorting(简单逆序数, 排序问题)
- poj1007 DNA Sorting(求逆序数)
- 1007 DNA Sorting(字符串+逆序数)
- poj 1007 DNA Sorting 【对逆序数进行sort排序】
- DNA逆序对的问题: DNA sorting
- poj 1007 DNA Sorting (求逆序数)
- POJ-1007-DNA Sorting-求逆序数
- POJ1007 DNA Sorting (求逆序数)
- POJ1007 DNA Sorting(求逆序数)
- poj 1007 DNA Sorting 求逆序数
- Pku acm 1007 DNA Sorting 排序算法解题报告(五)----求逆序数 排序
- DNA Sorting(DNA排序)
- POJ 1007 DNA Sorting(简单排序)
- POJ 1007 DNA sorting(统计逆序对数+归并排序)
- POJ 1007 DNA排序求逆序数
- poj1007 按逆序数排序DNA串
- DNA Sorting 1007 (字符串排序)
- poj1007 DNA Sorting 排序
- JDK版本不同导致的运行时错误
- 避免Android开发中的ANR
- 高斯滤波
- JAVA笔记【20131206】
- 基于visual Studio2013解决C语言竞赛题之0906文件插入
- Problem 62: DNA Sorting(简单逆序数, 排序问题)
- hdu 2089(不要62)数位DP
- MySQL的LIMIT与分页优化
- Steppingstone,Interal SRAM 4Kib,s3c2440a
- java常用库
- 电阻的分类
- 固定资产更新接口
- Ubuntu中root用户和user用户的相互切换
- 程序组件模块之间的内存管理