BC#59 (div.2) B
2015-10-11 01:54
471 查看
#include<cstdio> using namespace std; int a[1000]; int main() { int n, t; scanf("%d", &t); while (t--) { scanf("%d", &n); for (int i = 1; i <= n; i++) scanf("%d", a + i); int cur = n, res = 0; for (int i = n; i >= 1; i--) { if (a[i] == cur)cur--; } printf("%d\n", cur); } return 0; }
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 143 Accepted Submission(s): 105
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.
Input
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.
Output
For each testcase,output one line for an integer standing for the minimum steps Evensgn would use to reorder the books.
Sample Input
2
4
4 1 2 3
5
1 2 3 4 5
Sample Output
3
0
Source
BestCoder Round #59 (div.1)
相关文章推荐
- BC#59 (div.2)
- C#异步跟踪exe输出并输出到RichTextBox
- 对泛型列表进行排序和搜索
- 使用IComparable和IComparer接口对集合进行排序
- 【开源下载】c#编写的聊天程序微风IM 版本2 增加局域网P2P通信
- 编写一个C#程序,要求从键盘输入10个数存放在数组中,分别求出最大数和最小数存放在第一第二个元素里
- C# 使用Trace记录程序日志
- 【C#】ToString()参数中格式解析大全
- C# 3.0 新特性
- c# ascill码和对应字符转化
- C#更改文件访问权限所有者(适用于各个Windows版本)
- sphinx在c#.net平台下使用(一)
- C#语音SDKSDK接口开发经验及具体开发实现
- 建造者模式
- C# 错误!!容量超出了最大容量。参数名: capacity 这个是什么问题呢?
- c# 递归算法
- C# 图片流下载;图片流输出
- C# 怎样判断 datagridview 中的checkbox列是否被选中
- C#学习日记19----引用类型 之 委托(Delegate) 类型
- C#监控-程序池资源监控:CPU占用率、GC监控及邮件预警