hdu 5500 Reorder the Books
2015-11-18 11:31
246 查看
http://acm.hdu.edu.cn/showproblem.php?pid=5500
Total Submission(s): 942 Accepted Submission(s): 519
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each testcase,output one line for an integer standing for the minimum steps Evensgn would use to reorder the books.
[align=left]Sample Input[/align]
2
4
4 1 2 3
5
1 2 3 4 5
[align=left]Sample Output[/align]
3
0
[align=left]Source[/align]
BestCoder Round #59 (div.1)
假设开始时所有的顺序都是乱的则乱码数为n(即需要移动的步数也为n),从最后一位往前找递减列
找到一个符合的递减序列的元素,乱码数就减少1
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 942 Accepted Submission(s): 519
[align=left]Problem Description[/align]
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.
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each testcase,output one line for an integer standing for the minimum steps Evensgn would use to reorder the books.
[align=left]Sample Input[/align]
2
4
4 1 2 3
5
1 2 3 4 5
[align=left]Sample Output[/align]
3
0
[align=left]Source[/align]
BestCoder Round #59 (div.1)
假设开始时所有的顺序都是乱的则乱码数为n(即需要移动的步数也为n),从最后一位往前找递减列
找到一个符合的递减序列的元素,乱码数就减少1
#include<stdio.h> #include<math.h> #include<string.h> #include<stdlib.h> #include<algorithm> using namespace std; const int N = 30; int main() { int t, n, a ; scanf("%d", &t); while(t--) { scanf("%d", &n); for(int i = 1 ; i <= n ; i++) scanf("%d", &a[i]); int x = n; for(int i = n ; i >= 1 ; i--) { if(a[i] == x) x--;//乱码数 } printf("%d\n", x); } return 0; }
相关文章推荐
- [ay原创作品]用wpf写了个模仿36Kr网站登录背景的效果-【鄙视博客园,已被移出首页,代码在我自己官网上,自己下载学习吧】
- 《从零开始学Swift》学习笔记(Day 37)——默认构造函数
- 代码狗必看:前端开发3大坑
- Objective-C基础之常用简单设计模式
- JAVA 中BIO,NIO,AIO的理解
- php做app接口安全方案
- Android微信支付遇到的坑
- windows下安装PHP的redis扩展
- iOS开发——本地通知,本地推送(UILocalNotification)
- jquery特效大全
- vim中project多标签和多窗口的使用
- 创建窗口句柄时出错(error creating window handle)
- 详解SpringMVC中Controller的方法中参数的工作原理
- css3聊天框
- Apache Ant简介
- ai中常见的问题
- Content Hugging Priority & Content Compression Resistance Priority 区别
- android中java和JS互相调用,Web Console: Uncaught TypeError: Object [object Object] has no method
- Objective-C 基础之强大的字面量
- Activity透明/半透明效果的设置transparent(两种实现方法)