題干：

dxy has a collection of a series of books called "The Stories of SDOI",There are?n(n≤19)n(n≤19)?books in this series.Every book has a number from?11?to?nn.?

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)T(T≤30)?in the first line standing for the number of testcases.?

For each testcase, there is an positive integer?nn?in the first line standing for the number of books in this series.?

Followed?nn?positive integers separated by space standing for the order of the disordered books,the?ithith?integer stands for the?ithith?book's number(from top to bottom).?


Hint:?
For the first testcase:Moving in the order of?book3,book2,book1book3,book2,book1?,(4,1,2,3)→(3,4,1,2)→(2,3,4,1)→(1,2,3,4)(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本帶編號(hào)的書，現(xiàn)在給你打亂了順序，定義一次操作可以任選一本書并且放到最頂部。問你最少需要多少次操作可以將這一摞書調(diào)整為有序（編號(hào)從小到大）？

解題報(bào)告：

? ? ?直接模擬就行了。。先找出來需要移動(dòng)多少本書，假設(shè)是x本，那么肯定可以通過x次操作還原回來。

AC代碼：

#include<cstdio> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<string> #include<cmath> #include<cstring> #define ll long long #define pb push_back #define pm make_pair #define fi first #define se second using namespace std; const int MAX = 2e5 + 5; int ji,ou,all,n; int a[MAX]; int main() {int t;cin>>t;while(t--) {cin>>n;for(int i = 1; i<=n; i++) scanf("%d",a+i);int now = n,ans=0;for(int i = n; i>=1; i--) {if(now == a[i]) now--;else ans++;}printf("%d\n",ans);} return 0 ;}

?

總結(jié)

以上是生活随笔為你收集整理的【HDU - 5500】 Reorder the Books （思维）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。