题目：
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 nnin 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 5Sample Output
3 0
题目大意：
编号为1-n的书，每次只能从其中抽出一本放在书本的最上方，问至少操作多少次，可以使书本刚好有序。
解题思路：
假设开始时所有的顺序都是乱的则乱码数为n（即需要移动的步数也为n），从最后一位往前找递减列，找到一个符合的递减序列的元素，乱码数就减少1。
实现代码：
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<iostream>
using namespace std;
int main(){
int t,n,a[20];
cin>>t;
while(t--){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i = n;i >= 1;i--)
if(a[i] == n) n--;
cout<<n<<endl;
}
return 0;
}