Pop Sequence (25)

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.

输入描述:
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.

输出描述:
For each pop sequence, print in one line “YES” if it is indeed a possible pop sequence of the stack, or “NO” if not.

输入例子:
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

输出例子:
YES
NO
NO
YES
NO

---

大意
若按照顺序给你1~n这n个数，允许你用一个容量为m的栈作中转站，问你能否输出特定的整数序列。

分析
最直接的思路就是用一个栈来模拟这个过程，能不放栈则直接输出，否则压入栈。
若栈的高度超出了限制，则不能实现。

My Code

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<stack>
using namespace std;
const int maxn = 1009;

int main(){
	int max_size, ip_unm, qy_num;
	scanf("%d %d %d", &max_size, &ip_unm, &qy_num);
	stack<int>bridge;
	for (int i = 0; i < qy_num; i++){
		int input[maxn];
		while (!bridge.empty()){
			bridge.pop();
		}
		for (int j = 0; j < ip_unm; j++) scanf("%d", &input[j]);
		int nowat;
		int head = 1;	
		for (nowat = 0; nowat < ip_unm; nowat++){
			if (head == input[nowat]) {
				if (bridge.size() == max_size) goto tail;
				//cout << " directly : " << head << endl;
				head++;
				continue;
			}
			else if (!bridge.empty() && bridge.top() == input[nowat]){
				//cout << "pop() : " << bridge.top() << endl;
				bridge.pop();
				continue;
			}
			while (head != input[nowat]){
				//cout << " push() : " << head << endl;
				bridge.push(head++);
				if (bridge.size() > max_size){
					goto tail;
				}
			}
			nowat--;
		}
		tail:
		cout << (nowat == ip_unm && bridge.empty() ? "YES\n" : "NO\n");
	}
	return 0;
}

随笔
一道简单的模拟题，但是在做的过程中轻视了题目，没有想清楚就做了。思路和方向是正确的，但是用代码实现却总会有些
地方出差错，这时就会陷入找错误的时间比写代码的时间还要长的窘况。