41 1 s 128 MB
The cows are so very silly about their dinner partners. They have organized themselves into at most ten groups (conveniently numbered 1 through 10) that insist upon dining together. The trouble starts when they line up at the barn to enter the feeding area.
Each cow i carries with her a small card upon which is engraved Di (1 ≤ Di ≤ 10) indicating her dining group membership. The entire set of N (1 ≤ N ≤ 30,000) cows has lined up for dinner but it's easy for anyone to see that they are not grouped by their dinner-partner cards.
FJ's job is not so difficult. He just walks down the line of cows changing their dinner partner assignment by marking out the old number and writing in a new one. By doing so, he creates groups of cows like 111222333 or 333222111 where the cows' dining groups are sorted in either ascending or descending order by their dinner cards.
FJ is just as lazy as the next fellow. He's curious: what is the absolute minimum number of cards he must change to create a proper grouping of dining partners? He must only change card numbers and must not rearrange the cows standing in line.
Input consists of multiple test cases. For each test case, the first line contains a single integer N. The following N lines give N integers Di (1 ≤ Di ≤ 10), which describe each cow’s current dining group.
Input is terminated by EOF.
For each test case, write a single line which contains a single integer representing the minimum number of changes that must be made so that the final sequence of cows is sorted in either ascending or descending order.
5 1 3 2 1 1