杭电5500Reorder the Books
来源:互联网 发布:递四方 知乎 编辑:程序博客网 时间:2024/06/07 16:36
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 907 Accepted Submission(s): 499
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)
Recommend
hujie | We have carefully selected several similar problems for you: 5561 5560 5559 5558 5557
每次抽一个放在最前边,问多少次后使数组为升序:
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int a[110],b[110],i,j,k,l,m,n;int main(){scanf("%d",&k);while(k--){scanf("%d",&n);for(i=0;i<n;i++)scanf("%d",&a[i]);m=n;int ans=0;while(m)//一个个开始抽,从大到小 {for(i=0;i<n;i++)if(a[i]==m)break;//找到当前较大的数位置 for(;i<n;i++)if(a[i]==m-1)//找到之后把这个数前边的都往后移一位 {for(j=i;j>0;j--)a[j]=a[j-1];a[0]=m-1;//把这个数放首位 ans++;//表示进行了一步操作 break;}m--;}printf("%d\n",ans);}}
0 1
- 杭电5500Reorder the Books
- 杭电-5500Reorder the Books
- HDU 5500 Reorder the Books
- HDU 5500 Reorder the Books
- hdu 5500 Reorder the books
- hdu 5500 Reorder the Books
- HD 5500Reorder the Books
- HDU 5500 Reorder the Books
- hdu 5500 Reorder the Books
- HDOJ--5500--Reorder the Books
- hdoj 5500 Reorder the Books
- HDOJ 5500-Reorder the Books
- HDU 5500 Reorder the Books
- Reorder the Books HDU - 5500
- HDU 5500 Reorder the Books
- HDU 5500 Reorder the Books
- hdu 5500 Reorder the Books(模拟)
- HDU 5500 Reorder the Books(模拟)
- LeetCode----Insertion Sort List
- MyBatis(8)延迟加载
- Spark修炼之道(基础篇)——Linux大数据开发基础:第十二节:Shell编程入门(四)
- 第八课 MongoDB GridFS
- poj 2965 11/14
- 杭电5500Reorder the Books
- 多线程编程之四——线程的同步
- 简单工厂模式实例与讲解
- 月圆之夜,紫禁之巅,一剑西来,天外飞仙
- c++堆和栈(2)
- Play Framework2.1源码分析 - 架构设计及线程策略分析
- 局部变量、全局变量、堆、堆栈、静态和全局
- 深入学习微框架:Spring Boot
- android内核编译及模拟器运行过程记录