1051. 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

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<stack>
#include<vector>
#include<iostream>
#include<string>
using namespace std;
//栈模拟肯定用到栈
//v[index] 栈顶元素和v[index]相同时出栈

//从原始出发：入栈序列：每次进入一个 出栈：每次连续出n个 栈中元素不得超过最大容量 最后要完全和理论输出完全匹配
int main()
{
	int m,n,k;
	cin>>m>>n>>k;
	for(int i=0;i<k;i++){
		stack<int> s;//模拟用
		vector<int> v(n+1);//理论输出
		for(int j=0;j<n;j++)
			cin>>v[j];

		int cur=0;
		bool flag=false;
		for(int j=1;j<=n;j++){
			s.push(j);
			if(s.size()>m)	break;
			while(!s.empty() && s.top()==v[cur]){//一定要循环
				s.pop();
				cur++;
			}
		}
		if(cur==n){//处理完毕
			flag=true;
		}
		if(flag)	cout<<"YES\n";
		else cout<<"NO\n";
	}
	return 0;
}