POJ3210 a stack or a queue

C - A Stack or A Queue?

Crawling in process...Crawling failedTime Limit:1000MS    Memory Limit:32768KB     64bit IO Format:%lld & %llu

SubmitStatus

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 integerN 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 containsN 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

stackqueueboth
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.