02-线性结构4 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

解题思路

给定栈的容积M，按1~N的顺序入栈，判断出栈的序列是否可能
将输入的序列存入数组v，按顺序把1~N入栈，每次存入数字时判断是否超过栈的容积，从数组的第一个元素开始，判断与栈顶元素是否相等，相等就出栈，匹配下一个元素

#include<cstdio>
#include<vector>
#include<stack>
using namespace std;
int main()
{
	int M,N,K;
	scanf("%d %d %d",&M,&N,&K);
	while(K--){
		bool flag = false;
		stack<int> s;
		vector<int> v(N+1); 
		for(int i = 1; i <= N; i++)
			scanf("%d",&v[i]);
		int current = 1;
		for(int j = 1; j <= N; j++){
			s.push(j); //将元素入栈
			if(s.size() > M) break; //大小超过栈的容积，退出循环 
			while(!s.empty() && s.top() == v[current]){
				s.pop(); //如果栈顶元素和要出栈的元素相等，则出栈
				current++; //判断下一个要出栈的元素 
			}
		}
		if(current == N+1) flag = true; //出栈队列全部匹配 
		if(flag == true) printf("YES\n");
		else printf("NO\n"); 
	}
	return 0;
}