# Reorder the Books

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

Problem Description
dxy has a collection of a series of books called "The Stories of SDOI",There are n(n19) 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(T30) 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

#include<stdio.h>
int a[1100];
int main()
{
int  t,n;
scanf("%d",&t);
while(t--)
{
int i,mark=1;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
if(a[i]==n)
mark=i;
}
int temp=n;
for(i=mark;i>=0;i--)
{
if(a[i]==temp)
temp--;
}
printf("%d\n",temp);
}
return  0;
}


• 本文已收录于以下专栏：

## HDU 5500 Reorder the Books

Reorder the Books Time Li: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)...
• jerans
• 2016年11月23日 19:39
• 97

## HDU 5500 Reorder the Books(O(n)的复杂度就够了)——BestCoder Round #59(div.1 div.2)

HDU 5500 Reorder the Books(O(n)的复杂度就够了)——BestCoder Round #59(div.1 div.2)

## BestCoder Round #59 (div.2) HDU5500 Reorder the Books

Reorder the Books                                                             Time Limit: 4000/2000 ...

## hdu5500 Reorder the Books 贪心

• ww32zz
• 2015年10月11日 10:03
• 245

## 杭电-5500Reorder the Books

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/O...
• nvliba
• 2015年11月17日 17:40
• 224

## hdu acm 5500 Reorder the Books

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Oth...

## hdu 5500 Reorder the books 思维

Description 河老师家收藏了卢西奥写的一套书，叫做《混子故事集》，这套书有n本，每本书有一个编号，从1号到n号，河老师非常喜欢这套书，并把这些书按编号从小到大，从上往下摞成一摞。  ...

## Reorder the Books（模拟）

Reorder the Books    Accepts: 252    Submissions: 693  Time Limit: 4000/2000 MS (Java/Others)...

举报原因： 您举报文章：hdoj 5500 Reorder the Books 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)