hdoj 5500 Reorder the Books

原创 2015年11月17日 19:14:26

Reorder the Books

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


Problem Description
dxy has a collection of a series of books called "The Stories of SDOI",There are n(n19) 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(T30) 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
题意: 一摞书乱序的书,让你按照序号从小到大的顺序将其排列,一次只能拿一本书,且必须放在最上边,问最少多少步可以实现?
思路:我们把按照递增顺序的序号不动(条件:该序列必须递增到最大序号!),其他的序号的数目个数的和就是最少的次数,先找到最大数的位置向前找,再减小位置序号,寻找二大的数。。。,一直遍历全部数!
代码:
#include<stdio.h>
int a[1100];
int main()
{
    int  t,n;
    scanf("%d",&t);
    while(t--)
    {
        int i,mark=1;
        scanf("%d",&n);
        for(i=0;i<n;i++)
        {
        scanf("%d",&a[i]);
        if(a[i]==n)
        mark=i;
        }
        int temp=n;
        for(i=mark;i>=0;i--)
        {
            if(a[i]==temp)
            temp--; 
        }
        printf("%d\n",temp);
      }
    return  0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

HDOJ-5500Reorder the Books(规律)

本来一道水题,结果自己SB了,看到了n 赛后才回过神来......原来O(n)就可以!!! BC题解: By davidlee1999WTK 把这题的模型简化一下,有一个1→n1\rightarr...

HDU 5500 Reorder the Books

Reorder the Books Time Li: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)...
  • jerans
  • jerans
  • 2016年11月23日 19:39
  • 97

hdu 5500 Reorder the Books 【BestCoder Round #59 (div.2) 第二题】

思维,推导

HDU 5500 Reorder the Books(O(n)的复杂度就够了)——BestCoder Round #59(div.1 div.2)

HDU 5500 Reorder the Books(O(n)的复杂度就够了)——BestCoder Round #59(div.1 div.2)

BestCoder Round #59 (div.2) HDU5500 Reorder the Books

Reorder the Books                                                             Time Limit: 4000/2000 ...

hdu5500 Reorder the Books 贪心

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5500 思路:问题等价为,一个1~n组成的序列,每次从中取出一个数,插到最前面,用最少的步骤使序列变为升...
  • ww32zz
  • ww32zz
  • 2015年10月11日 10:03
  • 245

杭电-5500Reorder the Books

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/O...
  • nvliba
  • nvliba
  • 2015年11月17日 17:40
  • 224

hdu acm 5500 Reorder the Books

Reorder the Books Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Oth...

hdu 5500 Reorder the books 思维

Description 河老师家收藏了卢西奥写的一套书,叫做《混子故事集》,这套书有n本,每本书有一个编号,从1号到n号,河老师非常喜欢这套书,并把这些书按编号从小到大,从上往下摞成一摞。  ...

Reorder the Books(模拟)

Reorder the Books    Accepts: 252    Submissions: 693  Time Limit: 4000/2000 MS (Java/Others)...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj 5500 Reorder the Books
举报原因:
原因补充:

(最多只允许输入30个字)