hdoj 5500 Reorder the Books 【好题】
来源:互联网 发布:sony手机知乎 编辑:程序博客网 时间:2024/04/28 17:02
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 284 Accepted Submission(s): 197
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
题意:有n本书摞在一起,对应n个编号。每次可以抽出一本书放到顶部,问你最少需要操作几次使得n本书的编号从上到下升序排列。
没什么思路吧,瞎搞。证明···
AC代码:
#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int a[20];int main(){ int t; scanf("%d", &t); while(t--) { int n; scanf("%d", &n); int index; for(int i = 0; i < n; i++) { scanf("%d", &a[i]); if(a[i] == n) index = i; } int num = n; for(int i = index; i >= 0; i--) if(a[i] == num) num--; printf("%d\n", num); } return 0;}
0 0
- hdoj 5500 Reorder the Books 【好题】
- hdoj Reorder the Books 5500 (技巧) 好题
- hdoj 5500 Reorder the Books 【规律题】
- HDOJ--5500--Reorder the Books
- hdoj 5500 Reorder the Books
- HDOJ 5500-Reorder the Books
- HDOJ-5500Reorder the Books(规律)
- HDOJ 5500 Reorder the Books(贪心)
- hdoj 5500 Reorder the Books 【规律】
- hdoj 5500Reorder the Books【规律】
- hdoj--5500--Reorder the Books(技巧)
- HDOJ 5500 Reorder the Books(规律)
- hdoj 5500 Reorder the Books 【基础】
- HDOJ 5500 Reorder the Books(贪心)
- HDU 5500 Reorder the Books
- HDU 5500 Reorder the Books
- hdu 5500 Reorder the books
- hdu 5500 Reorder the Books
- 常用类 正则表达式
- Java反射、类加载与垃圾回收
- 【转】Java中的深拷贝和浅拷贝
- Laravel 报错 :Parse error: syntax error, unexpected 'class' (T_CLASS), expecting identifier (T_STRING)
- (vcpu-0)vcpu-0:VEREIFY vmcore/vmm/main/physMem_monitor.c.1123日志文件位于“E:OS X\vmware.log”
- hdoj 5500 Reorder the Books 【好题】
- 无线网络破解,破解wap密码
- C#自定义特性和反射
- js控制css样式
- 20-读《马云-我的人生哲学》记录一
- NSLog与printf的区别
- Java I/O
- weinre,移动端远程调试工具(适用于Android和Windows Phone)
- CodeForces 527B(字符串)