hdu 5500 Reorder the Books

Reorder the Books

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 463    Accepted Submission(s): 302

Problem Description

dxy has a collection of a series of books called "The Stories of SDOI",There are  n(n≤19)  books in this series.Every book has a number from  1  to  n .

dxy puts these books in a book stack with the order of their numbers increasing from top to bottom. dxy takes great care of these books and no one is allowed to touch them.

One day Evensgn visited dxy's home, because dxy was dating with his girlfriend, dxy let Evensgn stay at home himself. Evensgn was curious about this series of books.So he took a look at them. He found out there was a story about "Little E&Little Q". While losing himself in the story,he disrupted the order of the books.

Knowing that dxy would be back soon,Evensgn needed to get the books ordered again.But because the books were too heavy.The only thing Evensgn could do was to take out a book from the book stack and and put it at the stack top. 

Give you the order of the disordered books.Could you calculate the minimum steps Evensgn would use to reorder the books? If you could solve the problem for him,he will give you a signed book "The Stories of SDOI 9: The Story of Little E" as a gift.

 

Input

There are several testcases.

There is an positive integer  T(T≤30)  in the first line standing for the number of testcases.

For each testcase, there is an positive integer  n  in the first line standing for the number of books in this series.

Followed  n  positive integers separated by space standing for the order of the disordered books,the  ith  integer stands for the  ith  book's number(from top to bottom).


Hint:
For the first testcase:Moving in the order of  book3,book2,book1  , (4,1,2,3)→(3,4,1,2)→(2,3,4,1)→(1,2,3,4) ,and this is the best way to reorder the books.
For the second testcase:It's already ordered so there is no operation needed.

 

Output

For each testcase,output one line for an integer standing for the minimum steps Evensgn would use to reorder the books.

 

Sample Input

  
  

   
   2
4
4 1 2 3
5
1 2 3 4 5
  
  

 

Sample Output

  
  

   
   3
0
  
  

开始时错误的，开始的思路是只需要找有多少个数的前边有大于这个数的，那么结果就加1，结果存在返利，如2 4 5 1 3，依照自己的思路，结果是2，实际结果是3。最终，看了一下题解，是一个十分简单的暴力思路。如下：

直接先找到n所在的位置，然后寻找n-1的位置。

如果n-1在n的下边，那么就返回n-1，即需要n-1次的操作，原因很简单，因为现在要把n-1放在最上边，则除了n不要移动外，其他的都需要进行移动。

如果n-1在n的上边，那么n-1也就不需要移动，只需要继续寻找n-2，重复以上步骤即可。

Sample Output

   
   

    
    3
0