zoj3210 A Stack or A Queue?
来源:互联网 发布:jquery 二元数组 编辑:程序博客网 时间:2024/05/21 07:27
Description
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 contains N 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 N integers 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
Source
#include<cstdio>
using namespace std;
int a[105],b[105];
int main()
{
int t,n,i;
bool flag[4];
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
scanf("%d",&b[i]);
}
for(i=0;i<4;i++)
flag[i]=false;//
for(i=0;i<n/2;i++)
{
if(a[i]!=a[n-i-1])
{
flag[0]=true;
break;
}
}
if(!flag[0])
{
printf("both\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[i])
{
flag[1]=true;
break;
}
}
if(!flag[1])
{
printf("queue\n");
}
else
{
for(i=0;i<n;i++)
{
if(a[i]!=b[n-i-1])
{
flag[2]=true;
break;
}
}
if(!flag[2])
{
printf("stack\n");
}
else
{
printf("neither\n");
}
}
}
}
return 0;
}
- zoj3210 A Stack or A Queue?
- ZOJ3210-A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- A Stack or A Queue?
- 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?
- D - A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- ZOJ 3210 A Stack or A Queue?
- POJ3210 a stack or a queue
- ZOJ 3210 A Stack or A Queue?
- ZOJ#3210:A Stack or A Queue?
- 参数服务器在分布式深度学习的应用
- 05 JAVA 异常
- Foundation框架 - 集合
- Quartz2D - 01.概述
- python获取内存和cpu利用率记录日志文件
- zoj3210 A Stack or A Queue?
- 《零基础学Python(第二版)》(四)
- Andoid Sqlite 增查
- Visual Stdio VS 错误 error : 0xC00000FD: Stack overflow. 更改堆栈空间解决栈溢出问题
- 小白学开发(iOS)OC_成员变量的作用域(2015-07-27)
- Linux中C程序的存储空间布局 & C++的五大存储空间
- Quartz2D-02.利用Quartz画基本形状
- HTML5中表单验证的8种方法
- Android原生下拉刷新SwipeRefreshLayout实践