zoukankan      html  css  js  c++  java
  • hdoj--5500--Reorder the Books(技巧)

    Reorder the Books

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


    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
     

    Source
     

    #include<stdio.h>
    #include<string.h>
    int a[1010];
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n;
    		scanf("%d",&n);
    		int m=n;
    		for(int i=1;i<=n;i++)
    		scanf("%d",&a[i]);
    		for(int i=n;i>=1;i--)
    		{
    			if(m==a[i])
    			m--;
    		}
    		printf("%d
    ",m);
    	}
    	return 0;
    }


  • 相关阅读:
    Datawhale-新闻文本分类-task4-基于深度学习的文本分类1-fastText
    Datawhale-新闻文本分类-task3-机器学习分类
    (String)、toString、String.valueOf的区别
    抽象类与接口
    内部类详解
    关键字this---static---final
    Intent系列讲解---Intent简介以及相关属性
    Activity系列讲解---Activity的四大启动模式
    Activity系列讲解---Activity运行时的屏幕方向,全屏,窗体模式的设置
    Activity系列讲解---返回结果的处理
  • 原文地址:https://www.cnblogs.com/playboy307/p/5273724.html
Copyright © 2011-2022 走看看