POJ1007 DNA逆序数

最新推荐文章于 2020-03-07 20:20:15 发布

一条菜狗

最新推荐文章于 2020-03-07 20:20:15 发布

阅读量271

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/CSUstudent007/article/details/80850956

版权

博客详细讨论了POJ1007题目的解决方案，重点聚焦于线性代数中的逆序数概念。作者在实现过程中遇到了数组大小的问题，最初设定为55，导致运行错误。经过调试后发现，应该扩大数组到100才能避免超出范围的错误。作者提醒读者在处理类似问题时，应考虑适当放宽数组大小以防止意外的数据输入。

摘要由CSDN通过智能技术生成

DNA Sorting
Time Limit: 1000MS      Memory Limit: 10000K
Total Submissions: 108156       Accepted: 43326
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 (s