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

 ===================================================================

给定 K 个序列，判断是否是合法的出栈序列。

1.对每个输入的序列，先用数组存起来。

2.把1,2, 3, ..., n-1, n 的数字 依次入栈，对每一个入栈的数字进行判断。

怎么判断呢?    

while( !st.empty()  &&  arr[current] == st.top() ) {
                st.pop();
                current++； }

只要栈顶元素与输入序列的current变所指的元素相同，出栈，然后current+1。继续判断，如果一直相同一直出。不相同退出循环。

继续执行上一级的循环。（详细见代码）

 

 ===================================================================

#include <iostream>
#include <stack>
using namespace std;
int main(){
	int m, n, k, arr[1005];
	cin >> m >> n >> k;
	for(int i = 0; i < k; ++i){
		stack<int> st;
		int current = 1;
		bool flag = true;
		for(int j = 1; j <= n; ++j) cin >> arr[j];
		for(int j = 1; j <= n; ++j){
			st.push(j);
			if(st.size() > m){
				flag = false;
				break;
			}
			while(!st.empty() && arr[current] == st.top()){
				st.pop();
				current++;
			}
		}
		if(st.empty() == true && flag == true) cout << "YES" << endl;
		else cout << "NO" << endl;
	}
	return 0;
}