hdu 1379 DNA Sorting

向右看齐 2022-06-08 04:40 222阅读 0赞

DNA Sorting

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3435 Accepted Submission(s): 1661

Problem 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.

This problem contains multiple test cases!

The first line of a multiple input is an integer N, then a blank line followed by N input blocks. Each input block is in the format indicated in the problem description. There is a blank line between input blocks.

The output format consists of N output blocks. There is a blank line between output blocks.

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 (1 < 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’’. If two or more strings are equally sorted, list them in the same order they are in the input file.

Sample Input

  1. 1
  2. 10 6
  3. AACATGAAGG
  4. TTTTGGCCAA
  5. TTTGGCCAAA
  6. GATCAGATTT
  7. CCCGGGGGGA
  8. ATCGATGCAT

Sample Output

  1. CCCGGGGGGA
  2. AACATGAAGG
  3. GATCAGATTT
  4. ATCGATGCAT
  5. TTTTGGCCAA
  6. TTTGGCCAAA
  7. 题目大意:给你一系列DNA序列,根据他们的逆序数进行排序,按逆序数对由小到大输出,逆序数相等的时候,根据输入的前后顺序输出,
  8. 稍微提一下逆序数,就是当i<j时,a[i]>a[j],比如说AGCT,G < C,GC就是一对逆序数,其实就是求每个字母比他后面字母大的个数
  9. 思路:要用结构体储存字符串和他本身的逆序数,这里面用到了
  10. stable_sort(),stable_sort()可保证相等元素的原本相对次序在排序后保持不变。
  11. sort()不能保证这一点。
  12. AC代码:
  13. #include <string>
  14. #include <iostream>
  15. #include <algorithm>
  16. #include <cstdio>
  17. using namespace std;
  18. struct DNA{
  19. string str;
  20. int count; //用来记录这个字符串中的逆序数对
  21. }w[1005];
  22. bool cmp(DNA x,DNA y){
  23. return x.count < y.count;
  24. }
  25. int main(){
  26. int s, n, t;
  27. cin >> t;
  28. while(t--){
  29. scanf("%d %d",&s,&n);
  30. for(int i = 0; i < n; i++){
  31. cin>>w[i].str;
  32. w[i].count = 0;
  33. for(int j = 0; j < s; j++)
  34. for(int k = j + 1; k < s; k++)
  35. if(w[i].str[j] > w[i].str[k])
  36. w[i].count++;
  37. }
  38. stable_sort(w, w + n, cmp);
  39. for(int i = 0; i < n; i++)
  40. cout<< w[i].str <<endl;
  41. }
  42. return 0;
  43. }

发表评论

表情:
评论列表 (有 0 条评论,222人围观)

还没有评论,来说两句吧...

相关阅读