HDU 5500 Reorder the Books
来源:互联网 发布:nginx自定义错误页面 编辑:程序博客网 时间:2024/05/29 14:23
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 416 Accepted Submission(s): 270
Problem Description
dxy has a collection of a series of books called "The Stories of SDOI",There aren(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,theith 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)
第一次的时候没看清题,以为这是一道求逆序数的题。后来发现然而并不是。给出n本书,没本书都可以放在顶端。问至少几步可以让序列有序。
我觉的这是最简单的一种做法了。找到最大的数,然后想下找。
#include<stdio.h>#define N 20int a[N];int main(){ int t; scanf("%d",&t); while(t--) { int n,pos; scanf("%d",&n); for(int i=0;i<n;i++) { scanf("%d",&a[i]); if(a[i]==n) pos=i; } for(int i=pos;i>=0;i--) if(a[i]==n) n--; printf("%d\n",n); } return 0;}
0 0
- HDU 5500 Reorder the Books
- HDU 5500 Reorder the Books
- hdu 5500 Reorder the books
- hdu 5500 Reorder the Books
- HDU 5500 Reorder the Books
- hdu 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 Reorder the Books
- hdu 5500 Reorder the Books(模拟)
- HDU 5500 Reorder the Books(模拟)
- Reorder the Books-HDU-5500-BC59div2
- hdu acm 5500 Reorder the Books
- hdu 5500 Reorder the Books(贪心)
- HDU 5500:Reorder the Books【规律】
- HDU 5500 Reorder the Books【水题】
- 复习javascript基础 (1)
- Foundation Kit框架概叙
- 初步18-画星星
- 五个解决方案让MongoDB拥有RDBMS的鲁棒性事务
- Promise/deferred(转)
- HDU 5500 Reorder the Books
- javascript base库
- 写在开发前——android各种准备工作
- XMPPFramework框架的导入
- 新的开始——写给自己的话
- 利用Kali进行WiFi钓鱼测试实战
- 了解Promise Angular(转)
- Xcode 7 之SQL无法添加的问题(已解决)
- VC6.0 C++编译器有关!与++运算结果混乱的原因