HDU 5500 Reorder the Books （规律）

最新推荐文章于 2021-05-23 01:08:25 发布

SIUH

最新推荐文章于 2021-05-23 01:08:25 发布

阅读量306

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/x806073382/article/details/53296613

版权

思维专栏收录该内容

7 篇文章 0 订阅

订阅专栏

一道关于重新排列书籍的题目，描述了Evensgn如何在Dxy不在家时试图将打乱顺序的书籍按照数字顺序重新排列。给定一本系列书籍的混乱顺序，需要计算将它们恢复到正确顺序所需的最小步骤。解决方案涉及找到最大的数并向前查找递减子序列。

摘要由CSDN通过智能技术生成

Reorder the Books

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1416 Accepted Submission(s): 742

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

题意：
有一段连续的数字 1~n, 之后打乱其顺序，只能将后面的数字提至最前面，问要还原最少要几步？

思路：
从最大的数开始往前找递减子序列，n减去其长度就好

代码：

/*************************************************************************
    > File Name: 11_22c.cpp
    > Author: SIU
    > Created Time: 2016年11月22日 星期二 23时48分48秒
 ************************************************************************/

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int main()
{
    int t;
    int n;
    int num[25];
    int visit[25];
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        memset(num,0,sizeof(num));
        int item;
        for(int i=1;i<=n;i++)
        {
            scanf("%d",&num[i]);
            if(num[i]==n)
                item=i;
        }
        int max=n;
        int count=1;
        for(int i=item;i>0;i--)
        {
            if(i==item)
                continue;
            if(num[i]==max-1)
            {
                count++;
                max=max-1;
            }
        }
        printf("%d\n",n-count);
    }
    return 0;
}