UVA - 11995 - I Can Guess the Data Structure!(栈、队列、优先队列)

该博客介绍了一个UVA的编程题目,要求根据一系列操作判断数据结构是栈、队列、优先队列还是其他。输入包含若干测试用例,每个用例包含不同类型的操作,包括插入元素和返回元素。输出应为判断结果:栈、队列、优先队列或不可能。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

UVA 11995.I Can Guess the Data Structure!

Description

There is a bag-like data structure, supporting two operations:

operation meaning
1 x Throw an element x into the bag.
2 Take out an element from the bag.


Given a sequence of operations with return values, you’re going to guess the data structure. It is a stack (Last-In, First-Out), a queue (First-In, First-Out), a priority-queue (Always take out larger elements first) or something else that you can hardly imagine!

Input

There are several test cases. Each test case begins with a line containing a single integer n (1

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值