PTA-数据结构-02-线性结构4 Pop Sequence (25 分)

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

#include <iostream>
#include <stack>
#include <vector>

using namespace std;

int main(void)
{
	int M, N, K;
	cin >> M >> N >> K;
	
	vector<bool> result;
	
	//  input K series
	while(K--)
	{
		stack<int> s;
		bool state = true;
		int n = N;
		int i = 1;
		
		// for every series, input n numbers
		while(n--)
		{
			int cur ;
			cin >> cur;
			
			// push 1,2,...,n into s， until the top of s is equal to input number
			while(s.empty() || s.top() != cur)
			{
				// if the size of stack overflow, the series could not be generated
				if (s.size() == M)
					state = false;
				
				// stop pushing when all the numbers 1,2,...,n are already pushed
				if (i <= N)
				{
					s.push(i);
					i++;
				}
				else
				{
					break;
				}
			}
			
			// the top of s == input number, pop it out
			if (s.top() == cur)
				s.pop();
		}
		
		// if stack didn't overflow and all the numbers in s are popped, the series could be generated
		if (state && s.empty())
			result.push_back(true);
		else
			result.push_back(false);
	}
	
	for (int i=0;i<result.size();i++)
	{
		if (result[i])
			cout << "YES";
		else
			cout << "NO";
		
		if (i != result.size()-1)
			cout << endl;
	}
	
	return 0;
}