The 2016 Nordic Collegiate Programming Contest


2016-10-08 11:00 CEST

The 2016 Nordic Collegiate Programming Contest


2016-10-08 16:00 CEST
The end is near!
Contest is over.
Not yet started.
Contest is starting in -351 days 1:23:17

Time elapsed


Time remaining


Problem C
Card Hand Sorting

Sample Input 2 (cc by-sa NCPC 2016)
When dealt cards in the card game Plump it is a good idea to start by sorting the cards in hand by suit and rank. The different suits should be grouped and the ranks should be sorted within each suit. But the order of the suits does not matter and within each suit, the cards may be sorted in either ascending or descending order on rank. It is allowed for some suits to be sorted in ascending order and others in descending order.

Sorting is done by moving one card at a time from its current position to a new position in the hand, at the start, end, or in between two adjacent cards. What is the smallest number of moves required to sort a given hand of cards?


The first line of input contains an integer $n$ ($1 \le n \le 52$), the number of cards in the hand. The second line contains $n$ pairwise distinct space-separated cards, each represented by two characters. The first character of a card represents the rank and is either a digit from 2 to 9 or one of the letters T, J, Q, K, and A representing Ten, Jack, Queen, King and Ace, respectively, given here in increasing order. The second character of a card is from the set {s, h, d, c} representing the suits spades $\spadesuit $, hearts $\heartsuit $, diamonds $\diamondsuit $, and clubs $\clubsuit $.


Output the minimum number of card moves required to sort the hand as described above.

Sample Input 1 Sample Output 1
2h Th 8c Qh
Sample Input 2 Sample Output 2
9d As 2s Qd 2c Jd 8h
Sample Input 3 Sample Output 3
2h 3h 9c 8c