判断式的顺序也很重要！

1051 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 <cstdio>
#include <stack>
#include <algorithm>
using namespace std;

stack<int> seq;
int res[1005];

int main(){
	int maxn,N,M;
	scanf("%d %d %d",&maxn,&N,&M);
	while(M--){
		while(!seq.empty()){
			seq.pop();
		}
		for(int i = 0;i < N;i++){
			scanf("%d",&res[i]);
		}
		int pos = 0;
		for(int i = 1;i <= N;i++){
			seq.push(i);
			if(seq.size() > maxn) break;
			while(!seq.empty() && seq.top() == res[pos]){
			//这里的条件若是seq.top() == res[pos] && !seq.empty()会使程序出错
				seq.pop();
				pos++;
			}
		}
		if(pos == N) printf("YES\n");
		else printf("NO\n");
	}
	system("pause");
	return 0;
}