POJ3210 a stack or a queue
2015-08-24 16:56
447 查看
C - A Stack or A Queue?
Crawling in process...
Crawling failed
Time Limit:1000MS
Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit
Status
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
Sample Output
Crawling in process...
Crawling failed
Time Limit:1000MS
Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit
Status
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
4 3 1 2 3 3 2 1 3 1 2 3 1 2 3 3 1 2 1 1 2 1 3 1 2 3 2 3 1
Sample Output
stack queue both neither#include <iostream> using namespace std; const int maxn=100+10; int main() { int a[maxn]; int T,n,i; cin>>T; while(T--) { cin>>n; for(i=0; i<n; i++) cin>>a[i]; bool isque=true; bool issta=true; for(i=0; i<n; i++) { int x; cin>>x; if(x!=a[i]) isque=false; if(x!=a[n-1-i]) issta=false; } if(isque&&issta) cout<<"both"<<endl; else if(isque) cout<<"queue"<<endl; else if(issta) cout<<"stack"<<endl; else cout<<"neither"<<endl; } return 0; }
学习心得:
要学会用bool标记对错
另外一个思想是每次输入一个字符与之前存储的a[i]数组进行比较,只要有一个不符合要求,即标记为false.
相关文章推荐
- MII、GMII、RMII、SGMII、XGMII、XAUI、Interlaken
- DuiLib : 使用CListUI显示海量数据
- JAVA UUID 生成
- easyiui textbox 光标 聚焦
- 程序检测系统是bios引导还是uefi引导
- UITabbarViewController+Navigation框架下的子视图的跳转示例之一
- UIActionSheet的常见用法
- poj 2051 priority_queue应用
- CF_313B_IlyaAndQueries
- 08-排序3. Talent and Virtue (25)
- 调用[[UIDevice currentDevice] userInterfaceIdiom]==UIUserInterfaceIdiomPad判断设备
- UE4 WorldPositionOffset
- 【已解决】Request exceeded the limit of 10 internal redirects due to probable configuration error.
- 关于UIView的autoresizingMask属性的研究
- UE3 供游戏性程序员的使用的性能最优化方法
- Codeforces 313B : Ilya and Queries
- UE4 Light Propagation Volumes
- poj--2778DNA Sequence+AC自动机+矩阵快速幂
- A Flexible New Technique for Camera Calibration
- IOS生成UUID