A Stack or A Queue?(zoj 3210)
来源:互联网 发布:沈阳seo顾问11sem 编辑:程序博客网 时间:2024/05/22 17:38
Do you know stack and queue? They're both important data structures. A stack is a "first in last out" (FILO) data structure and a queue is a "first in first out" (FIFO) one.
Here comes the problem: given the order of some integers (it is assumed that the stack and queue are both for integers) going into the structure and coming out of it, please guess what kind of data structure it could be - stack or queue?
Notice that here we assume that none of the integers are popped out before all the integers are pushed into the structure.
Input
There are multiple test cases. The first line of input contains an integer T (T <= 100), indicating the number of test cases. Then T test cases follow.
Each test case contains 3 lines: The first line of each test case contains only one integer N indicating the number of integers (1 <= N <= 100). The second line of each test case containsN integers separated by a space, which are given in the order of going into the structure (that is, the first one is the earliest going in). The third line of each test case also contains Nintegers separated by a space, whick are given in the order of coming out of the structure (the first one is the earliest coming out).
Output
For each test case, output your guess in a single line. If the structure can only be a stack, output "stack"; or if the structure can only be a queue, output "queue"; otherwise if the structure can be either a stack or a queue, output "both", or else otherwise output "neither".
Sample Input
431 2 33 2 131 2 31 2 331 2 11 2 131 2 32 3 1
Sample Output
stackqueuebothneither
比较简单的一题
#include<iostream>using namespace std;int maxn=100+10; int main() { int N,n; cin>>N; int a[maxn],b[maxn]; while(N--) { bool s=true,q=true;cin>>n; for(int i=0;i<n;i++) cin>>a[i]; for(int i=0;i<n;i++) cin>>b[i];for(int i=0;i<n;i++) if(a[i]!=b[n-i-1]) { s=false; break; }for(int i=0;i<n;i++) if(a[i]!=b[i]) { q=false; break; } if(s==true&&q==true) cout<<"both"<<endl; else if(s==true&&q==false) cout<<"stack"<<endl; else if(s==false&&q==true) cout<<"queue"<<endl; else cout<<"neither"<<endl;}return 0; }
- ZOJ 3210 A Stack or A Queue
- zoj 3210 A Stack or A Queue?
- A Stack or A Queue?(zoj 3210)
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ#3210:A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue ?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210A Stack or A Queue?
- zoj 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue ? 水
- ZOJ 3210A Stack or A Queue?(暴力)
- ZOJ 3210 A Stack or A Queue?【模拟】
- ZOJ 3210 A Stack or A Queue? 水题
- A Stack or A Queue?
- A Stack or A Queue?
- Oracle的substr函数简单用法 与substring区别
- [Cocoa]深入浅出 Cocoa 之 Core Data(1)- 框架详解
- ISP DSP diff
- Grails2的基本集合类型映射
- Cocoa 获取一个独特的电脑硬件ID (A unique hardware id)
- A Stack or A Queue?(zoj 3210)
- Python 参数知识(变量前加星号的意义)
- VMC命令 Bluemix
- (poj 1475) Pushing Boxes
- L型代码结构设计案例:BrothersDropdownList()
- 学习jar命令 创建和解压jar文件包
- 反射(成员变量Field和成员函数Method的反射)
- android repo 切换分支
- spring 注解1