02-3. Pop Sequence (25)

02-3. Pop Sequence (25)

时间限制

100 ms

内存限制

65536 kB

代码长度限制

8000 B

判题程序

Standard

作者

CHEN, Yue

Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop randomly. You are supposed to tell if a given sequence of numbers is a possible pop sequence of the stack. For example, if M is 5 and N is 7, we can obtain 1, 2, 3, 4, 5, 6, 7 from the stack, but not 3, 2, 1, 7, 5, 6, 4.

Input Specification:

Each input file contains one test case. For each case, the first line contains 3 numbers (all no more than 1000): M (the maximum capacity of the stack), N (the length of push sequence), and K (the number of pop sequences to be checked). Then K lines follow, each contains a pop sequence of N numbers. All the numbers in a line are separated by a space.

Output Specification:

For each pop sequence, print in one line "YES" if it is indeed a possible pop sequence of the stack, or "NO" if not.

Sample Input:

5 7 5
1 2 3 4 5 6 7
3 2 1 7 5 6 4
7 6 5 4 3 2 1
5 6 4 3 7 2 1
1 7 6 5 4 3 2

Sample Output:

YES
NO
NO
YES
NO

栈的考查，栈空或是top指向的数据不等于输入的数据，则继续压栈；栈的top指向的数据等于输入数据时，从栈中pop出一个数据；如果栈的size>M时，输出“NO”；当全部输入数据都能push和pop出时，输出“YES”，否则输出“NO”。

#include<iostream>
#include<stack>
using namespace std;

int main()
{
	int i,M,N,K,temp;
	cin>>M>>N>>K;
	while(K--){
		int num=1;
		bool flag=true;
		stack<int> s;
		for(i=0;i<N;i++){
			cin>>temp;
			if(flag){
				while(s.empty() || s.top()!=temp){
					s.push(num);
					if(s.size()>M){
						flag=false;
						break;
					}
					num++;
				}
				if(flag && (!s.empty()) && s.top()==temp)
					s.pop();
			}
		}
		if(flag==true)
			cout<<"YES"<<endl;
		else
			cout<<"NO"<<endl;
	}
	return 0;
}