PAT (Advanced Level) 1051. Pop Sequence (25) 是否为pop序列，模拟栈的操作

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

使用一个stack模拟操作，看是否能得到所给序列。

/*2015.7.26cyq*/
#include <iostream>
#include <vector>
#include <stack>
using namespace std;

int check(const vector<int> &ivec,int M,int N){
	stack<int> stk;
	int i=0;//给定的序列的索引
	int j=1;//用来压入的数字
	while(1){
		//持续压入数字直到stk.top()==ivec[i]
		while(stk.empty()||stk.top()!=ivec[i]){
			stk.push(j++);
			if(stk.size()==M){//栈满
				if(stk.top()==ivec[i]){
					stk.pop();
					i++;
					if(i==N){
						if(stk.empty())
							cout<<"YES"<<endl;
						else
							cout<<"NO"<<endl;
						return 0;
					}
				}else{
					cout<<"NO"<<endl;
					return 0;
				}
			}
		}
	
		if(!stk.empty()){//弹出栈顶匹配数字
			stk.pop();
			i++;
		}

		if(i==N&&stk.empty()){
			cout<<"YES"<<endl;
			return 0;
		}
	}
	return 0;
}

int main(){
	int M,N,K;
	cin>>M>>N>>K;
	vector<int> ivec(N);
	while(K--){
		for(int i=0;i<N;i++)
			cin>>ivec[i];
		check(ivec,M,N);
	}
	return 0;
}