POJ1007 DNA Sorting
来源:互联网 发布:内存泄露java 编辑:程序博客网 时间:2024/05/16 16:16
Description
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
Output
Sample Input
10 6AACATGAAGGTTTTGGCCAATTTGGCCAAAGATCAGATTTCCCGGGGGGAATCGATGCAT
Sample Output
CCCGGGGGGAAACATGAAGGGATCAGATTTATCGATGCATTTTTGGCCAATTTGGCCAAA
#include<iostream>#include<string>using namespace std;int main(){int n, m;cin >> n >> m;//m表示行 n表示列//char **a = new char *[m];//动态创建行数//for (int i = 0; i < m; i++)//动态创建列数//{//a[i] = new char[n];//}int *countLine = new int[m];string *str = new string[m];for (int i = 0; i < m; i++){cin >> str[i];countLine[i] = 0;}for (int i = 0; i < m; i++)//每一行{for (int k = 0; k < n; k++){char temp = str[i][k];for (int j = k; j < n; j++)//判断这一行的字母有几个小于该字母的{if (temp>str[i][j]){countLine[i]++;}}}}for (int i = 1; i < m; i++){for (int j = 0; j < m-i; j++){if (countLine[j] > countLine[j + 1]){int temp = countLine[j];countLine[j] = countLine[j + 1];countLine[j + 1] = temp;string tempStr = str[j];str[j] = str[j + 1];str[j + 1] = tempStr;}}}for (int i = 0; i < m; i++){cout << str[i] << endl;}return 0;}
- POJ1007 DNA Sorting
- poj1007(DNA Sorting)
- POJ1007 DNA Sorting 水题
- POJ1007·DNA Sorting
- POJ1007:DNA Sorting
- POJ1007 DNA Sorting
- poj1007 DNA Sorting
- poj1007 - DNA Sorting
- poj1007 DNA Sorting 排序
- POJ1007-DNA Sorting-ACM
- POJ1007 DNA Sorting
- POJ1007--DNA Sorting
- POJ1007 DNA Sorting
- POJ1007.DNA Sorting
- POJ1007 DNA Sorting
- POJ1007 DNA Sorting
- 【poj1007】 DNA Sorting
- POJ1007 DNA Sorting
- 谈论Java递归列出文件目录结构
- loadrunner 测试错误分析
- 解密jQuery事件核心 - 委托设计(二)
- latched之Single Number III
- C/C++头文件说明
- POJ1007 DNA Sorting
- 图片按比例缩放
- SQL Date 函数 高级教程
- 导航设置
- jQuery对下拉框Select操作总结
- Java String类中的常量池鱼intern()
- android: ListView,及数据库操作,模拟实现 联系人功能
- web.xml配置详解
- java上传word2007需要struts配置吗?