HDU 5500 - Reorder the Books(模拟)
2016-11-24 03:47
375 查看
Reorder the Books
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1432 Accepted Submission(s): 755
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
题意:
给出n个数,要求将他们变为有序递增的(调整的时候,只能选一个放到数组的开头),每个数都大于等于1,小于等于n,而且互不相等。
解题思路:
从底部往前找,如果有序,就不用放到前面。
AC代码:
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1432 Accepted Submission(s): 755
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
题意:
给出n个数,要求将他们变为有序递增的(调整的时候,只能选一个放到数组的开头),每个数都大于等于1,小于等于n,而且互不相等。
解题思路:
从底部往前找,如果有序,就不用放到前面。
AC代码:
#include<bits/stdc++.h> using namespace std; int a[20]; int main() { int T; scanf("%d",&T); while(T--) { int n; scanf("%d",&n); for(int i = 1;i <= n;i++) scanf("%d",&a[i]); for(int i = n;i >= 1;i--) if(a[i] == n) n--; printf("%d\n",n); } return 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 5500 Reorder the Books(O(n)的复杂度就够了)——BestCoder Round #59(div.1 div.2)
- hdu 5500 Reorder the Books【贪心】【思维】
- Reorder the Books-HDU-5500-BC59div2
- 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