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.

把待检测的数列表示成arr，用i记录当前比较的数的下标。构建一个栈，依次把N个数字压进去，每压一个，就对比栈顶元素和arr[i]，如果相等s就pop，++i，继续比较。N个数字全部压完后比较i和N，判断arr是否可能。具体实现还要考虑栈满的情况。

#include<iostream>
#include<stack>

using namespace std;
int main() {
	int M, N, K;
	cin >> M >> N >> K;
	int arr[1000];
	int result[1000];
	stack<int> s;
	int j = 0;
	for (int line = 0; line < K; ++line) {
		for (int k = 0; k < N; k++)
			cin >> arr[k];
		for (int i = 1; i <= N; ++i) {

			s.push(i);
			while (!s.empty() && s.size() <= M&&s.top() == arr[j]) {
				s.pop();
				++j;
			}
		}
		if (j < N)
			result[line] = 0;
		else
			result[line] = 1;
		j = 0;
		while (!s.empty())
			s.pop();
	}
	for (int i = 0; i < K; ++i) {
		if (result[i])
			cout << "YES" << endl;
		else
			cout << "NO" << endl;
	}
	
	return 0;
}