POJ 1007 DNA Sorting

本文介绍了一种用于排序DNA序列的算法,该算法基于序列的“排序性”而非字母顺序进行排列,通过计算序列中逆序对的数量来衡量其排序程度,并使用归并排序稳定地按非递减排列。

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

 

DNA Sorting

Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 89359 Accepted: 35910

 

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

 

 一样求逆序对数,根据逆序对数的数量稳定的排序(非递减),再输出DNA序列。依然是用归并排序,求逆序对数。

 

 

import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by 小粤 on 2015/8/4.
 */
public class Main
{
    private static DNA[] dnas;
    private static char[] characters = new char[50];
    private static char[] aux = new char[50];

    public static void sort(int lo, int hi, int dnasIndex)
    {
        if (lo >= hi)
            return;

        int mid = (lo + hi) / 2;
        sort(lo, mid, dnasIndex);
        sort(mid + 1, hi, dnasIndex);
        merge(lo, mid, hi, dnasIndex);
    }

    private static void merge(int lo, int mid, int hi, int dnasIndex)
    {
        int i = lo, j = mid + 1;

        for (int k = lo; k <= hi; k++)
        {
            aux[k] = characters[k];
        }

        for (int k = lo; k <= hi; k++)
        {
            if (i > mid)
            {
                characters[k] = aux[j++];
            }
            else if (j > hi)
            {
                characters[k] = aux[i++];
            }
            else if (aux[j] < aux[i])
            {
                characters[k] = aux[j++];
                dnas[dnasIndex].counter += mid - i + 1;
            }
            else
            {
                characters[k] = aux[i++];
            }
        }
    }

    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);

        int lengthOfStrings = scanner.nextInt();
        int numberOfStrings = scanner.nextInt();

        dnas = new DNA[numberOfStrings]; // Oh, shit! Because of Arrays.sort()..

        for (int i = 0; i < numberOfStrings; i++)
        {
            dnas[i] = new DNA();
            dnas[i].string = scanner.next();
            for (int j = 0; j < lengthOfStrings; j++)
            {
                characters[j] = dnas[i].string.charAt(j);
            }

            sort(0, lengthOfStrings - 1, i);
        }

        Arrays.sort(dnas);
        for (DNA dna : dnas)
        {
            System.out.println(dna);
        }
    }
}

class DNA implements Comparable<DNA>
{
    public String string;
    public int counter;

    @Override
    public int compareTo(DNA o)
    {
        return counter - o.counter;
    }

    @Override
    public String toString()
    {
        return string;
    }
}

 

 

 

内容概要:本文详细介绍了900W或1Kw,20V-90V 10A双管正激可调电源充电机的研发过程和技术细节。首先阐述了项目背景,强调了充电机在电动汽车和可再生能源领域的重要地位。接着深入探讨了硬件设计方面,包括PCB设计、磁性器件的选择及其对高功率因数的影响。随后介绍了软件实现,特别是程序代码中关键的保护功能如过流保护的具体实现方法。此外,文中还提到了充电机所具备的各种保护机制,如短路保护、欠压保护、电池反接保护、过流保护和过温度保护,确保设备的安全性和可靠性。通讯功能方面,支持RS232隔离通讯,采用自定义协议实现远程监控和控制。最后讨论了散热设计的重要性,以及为满足量产需求所做的准备工作,包括提供详细的PCB图、程序代码、BOM清单、磁性器件和散热片规格书等源文件。 适合人群:从事电力电子产品研发的技术人员,尤其是关注电动汽车充电解决方案的专业人士。 使用场景及目标:适用于需要高效、可靠充电解决方案的企业和个人开发者,旨在帮助他们快速理解和应用双管正激充电机的设计理念和技术要点,从而加速产品开发进程。 其他说明:本文不仅涵盖了理论知识,还包括具体的工程实践案例,对于想要深入了解充电机内部构造和工作原理的人来说是非常有价值的参考资料。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值