北大oj1007——DNA Sorting

最新推荐文章于 2024-04-21 21:37:17 发布

椰子糖莫莫

最新推荐文章于 2024-04-21 21:37:17 发布

阅读量207

点赞数

CC 4.0 BY-SA版权

文章标签：数据结构算法 mysql hashmap mapreduce

本文链接：https://blog.youkuaiyun.com/m0_37609239/article/details/122319376

该博客讨论了一种衡量序列排序程度的方法——倒置数，并介绍了如何对DNA字符串进行排序。博主给出了一个C++程序，该程序计算输入的DNA字符串的倒置数并按照排序程度从高到低输出。程序利用map和vector来处理可能出现的相同排序值，并保持原始输入顺序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

DNA Sorting
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 121022 Accepted: 48292
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

主要还是只用map的自动排序方法，不同的是，作为map的key可能会重复(使用排序值作为key)，题目要求按顺序排列同排序值的，所以使用了vector作为key，vector里push了两个值，第一个值是排序值，第二个值是当前计算的是第几个，以此作为排序大小。

#include <iostream>
#include<map>
#include <algorithm>
#include<string>
#include<vector>
using namespace std;

int main()
{
    std::map<vector<int>, string> str;
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        char s[101];
        cin >> s;
        
        //计算排序值
        int sortValue = 0;
        for (int index = 0; index < n; index++) {
            for (int big = index + 1; big < n; big++) {
                if (s[index] > s[big]) {
                    sortValue++;
                }
            }
        }

        vector<int> vec;
        vec.push_back(sortValue);
        vec.push_back(i);
        str.insert(make_pair(vec, s));
        vec.clear();
    }

    map<vector<int>, string>::iterator iter;
    for (iter = str.begin(); iter != str.end(); ++iter) {
        cout << (*iter).second << endl;
    }

    return 0;
}