poj 1007 java

 

 

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

 

 

 

 

 

import java.util.ArrayList; 
import java.util.Collections;
import java.util.Comparator;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

/**
 * @author baoyou E-mail:curiousby@163.com
 * @version 创建时间：2015年9月30日 下午2:48:46 des:
 * 
 * <pre>
 * 
 * </pre>
 */
public class BaoyPoj1007Test {

	public static class Node  {
		public String data;
		public int sum ; 
	}
	
	@SuppressWarnings({ "unused", "resource" })
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int cols = in.nextInt();
		int rows = in.nextInt(); 
		
		List<Node> list = new ArrayList<Node>();
		
		Set<Node> set = new TreeSet<Node>();
		for (int i = 0; i < rows; i++) {
			Node n = new Node();
			n.data = in.next();
			n.sum = times(n.data); 
           list.add(n);
		}
		
		Collections.sort(list, new Comparator<Node>() {
			public int compare(Node o1, Node o2) { 
				if (o1.sum > o2 .sum)
					return 1;
				else if(o1.sum == o2 .sum) 
					return 0;
				else 
					return -1;
			}  
		});
		
		for (Node n :list) {
			System.out.println(n.data);
		}

	}

	public static int times(String dna ) {
		int sum = 0;
		for (int i = 0; i < dna.length(); i++)
			for (int j = i + 1; j < dna.length(); j++)
				if ((int)dna.charAt(i) > (int) dna.charAt(j))
					sum++;
		return sum;
	}

}