【题解】HDU 1702 ACboy needs your help again!

最新推荐文章于 2019-09-21 17:25:37 发布

飒染霜林

最新推荐文章于 2019-09-21 17:25:37 发布

阅读量271

点赞数

分类专栏： HDU题解

本文链接：https://blog.csdn.net/qq_41220023/article/details/81358782

版权

ACboy被绑架了，困在一个黑暗的迷宫中。为了救他，你必须解决怪物提出的基于FIFO（先进先出）和FILO（先进后出）原理的问题。每个问题包含一系列的'IN M'（输入一个整数M）或'OUT'（输出栈或队列顶部的元素）指令。你需要根据FIFO或FILO的规则，正确处理这些指令并回答问题。当没有元素可输出时，回答'None'。题目提供了样例输入和输出，帮助理解题目的具体操作。

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

题目描述

题意分析

题目描述

Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)

Problem Description

ACboy was kidnapped!!
he miss his mother very much and is very scare now.You can't image how dark the room he was put into is, so poor :(.
As a smart ACMer, you want to get ACboy out of the monster's labyrinth.But when you arrive at the gate of the maze, the monste say :" I have heard that you are very clever, but if can't solve my problems, you will die with ACboy."
The problems of the monster is shown on the wall:
Each problem's first line is a integer N(the number of commands), and a word "FIFO" or "FILO".(you are very happy because you know "FIFO"