Pop Sequence

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

设置一个变量tmp，由1开始自增。当栈顶元素与输入的元素不匹配时将当前tmp入栈并tmp自加，当匹配时栈顶出栈。

#include<iostream>
#include<stack>
using namespace std;
int main()
{
	int m,n,k,input,temp;
	bool flag;
	cin>>m>>n>>k;
	for(int i=0;i<k;++i)
	{
		stack<int> sData;
		flag=true;
		temp=1;
		for(int j=0;j<n;++j)
		{
			cin>>input;
			while(flag)
			{
				if(sData.empty()||sData.top()!=input)
				{
					sData.push(temp);
					if(sData.size()>m)
					{
						flag=false;
						break;
					}
					temp++;
				}
				else if(!sData.empty()&&sData.top()==input)
				{
					sData.pop();
					break;
				}
			}
		}
		if(!sData.empty())
			flag=false;
		if(flag)
			cout<<"Yes"<<endl;
		else
			cout<<"No"<<endl;
	}
	return 0;
}