hdoj5500Reorder the Books
来源:互联网 发布:js接口安全域名怎么填 编辑:程序博客网 时间:2024/05/21 20:24
Reorder the Books
Time 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.
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 integerT(T≤30) in the first line standing for the number of testcases.
For each testcase, there is an positive integern in the first line standing for the number of books in this series.
Followedn 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 ofbook3,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.
There is an positive integer
For each testcase, there is an positive integer
Followed
Hint:
For the first testcase:Moving in the order of
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
244 1 2 351 2 3 4 5
Sample Output
30
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;}
0 0
- hdoj5500Reorder the Books
- the books about java
- HIT the Books!
- ZOJ2727 List the Books
- the books of computer
- List the Books(sort)
- HDU_5500 Reorder the Books
- hdu5500--Reorder the Books
- hdu5500 Reorder the Books
- HDU Reorder the Books
- hdu5500 Reorder the Books
- 7 Books about the Celts
- The Most Important C++ Books
- The Plan Of Reading Books
- zoj 2727 list the books
- ZOJ 2727List the Books
- ZOJ 2727 List the Books
- ZOJ List the Books 水~
- js 源码
- dxp使用官网Vault库教程
- android 调用Camera,获取预览帧中的图像
- 牛腩概览
- JavaScript高级程序设计读书笔记—— 基本数据类型
- hdoj5500Reorder the Books
- Android读书笔记---RemoteViews 远程View
- sql 语句
- 初学hadoop遇到的问题
- SpringMVC返回json数据的三种方式
- 字符串化运算符 (#)
- 从头认识java-8.11 为什么需要内部类?(2)
- 数据库——SQL语句总结
- 【黑马程序员】IO流的几个问题