zoukankan      html  css  js  c++  java
  • Reorder the Books-HDU5500

    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>
    #include<string.h>
    #include<algorithm>
    #include<iostream>
    #include<stdlib.h>
    #include<stack>
    #include<queue>
    
    using namespace std;
    
    #define N 110
    stack<int>Q;
    int main()
    {
        int T,n,i,a[N];
        scanf("%d",&T);
        while(T--)
        {
            scanf("%d",&n);
            for(i=1;i<=n;i++)
            {
                scanf("%d",&a[i]);
            }
            int ans=n;
            for(i=n;i>0;i--)
            {
                if(a[i]==ans)
                    ans--;
            }
            printf("%d
    ",ans);
        }
        return 0;
    }
  • 相关阅读:
    大数据和云计算如何实现视频行业更快速有效的智能分析?
    TSINGSEE青犀视频云边端架构流媒体平台的接口鉴权和接口保活是什么关系?
    TSINGSEE青犀视频和海康合作研发RTMP摄像头如何通过内存卡进行视频录像存储?
    RTMP视频推流功能组件EasyRTMP-HIK DEMO版本运行报错0xc000007b问题排查分析
    互联网视频直播&点播平台RTMP推流组件EasyRTMP如何获取当前推流状态 ?
    程序员修炼之道阅读笔记(一)
    周进度总结
    2020年秋季个人阅读计划
    周进度总结
    Java的Swing布局
  • 原文地址:https://www.cnblogs.com/linliu/p/4974259.html
Copyright © 2011-2022 走看看