hdoj5500Reorder the Books
2015-11-15 22:12
405 查看
Reorder the BooksTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 932 Accepted Submission(s): 513 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 Source BestCoder Round #59 (div.1) |
#include<cstdio> #include<cstdlib> #include<cstring> #include<algorithm> #include<cmath> using namespace std; int vis[20]; int main() { int t,n,i,j,k; scanf("%d",&t); while(t--){ scanf("%d",&n); for(i=1;i<=n;++i){ scanf("%d",&k);vis[k]=i; } for(i=n;i>1;--i){ if(vis[i]<vis[i-1])break; } printf("%d\n",i-1); } return 0; }
相关文章推荐
- Ubuntu 下修改 Could not reliably determine the serve
- The Grabber v1.4.8.2 (2007.05.18) 下载
- List all the Databases on a SQL Server
- Using the TextRange Object
- Nginx出现The plain HTTP request was sent to HTTPS port问题解决方法
- the import cannot be resolved
- The APR based Apache Tomcat Native library which allows ...java.library...异常
- The art of software testing翻译--第一章
- The art of software testing翻译--第三章(1)
- xcode常见错误解析
- 的的
- The Difference Between “Add Web Reference” and “Add Service Reference”
- Get the SID of an Active Directory User
- The following types may not be used as proxies 异常处理办法
- The application’s PagerAdapter changed the adapter’s contents without calling PagerA
- Apache 502 The proxy server 解决办法
- can't turn off the calendar reminder...
- Missy Elliott 2005年专辑『The Cookbook』介绍(转自:: 华纳线上音乐杂志)
- BFD in the Metro Ring
- 虚拟机vmx打不开 Failed to lock the file的解决方法(转 载)