# 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<iostream>
#include<stack>
#include<stdio.h>
using namespace std;
int main(){
for(int m,n,k;scanf("%d%d%d",&m,&n,&k)!= EOF;){
while(k--){
stack<int>sta;
int flag = 1;
for(int i = 0; i < n;i++){
int num;
scanf("%d",&num);
if(flag){
//当栈为空栈或者说是栈的元素还不等于读取的数字的时候，一直对栈进行push操作，中间判断栈容量是否超过
while(sta.size() == 0 || sta.top() != num){
if(sta.size() > m){
flag = 0;
break;
}
}
if(flag && sta.size() >= 1 && sta.top() == num){
sta.pop();
}
}
}
if(flag){
printf("YES\n");
}else{
printf("NO\n");
}
}
}
return 0;
}

• 本文已收录于以下专栏：

## 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 p...
• LchinaM
• 2015年03月06日 12:03
• 467

## PAT-A-1051 Pop Sequence 【栈】

1051. Pop Sequence (25)Given a stack which can keep M numbers at most. Push N numbers in the order o...

## 02-线性结构4 Pop Sequence (25分)

Given a stack which can keep MM numbers at most. Push NN numbers in the order of 1, 2, 3, …, NN and ...

## 02-线性结构4 Pop Sequence (25分)

Given a stack which can keep MMM numbers at most. Push NNN numbers in the order of 1, 2, 3, …, NNN a...

## Pop Sequence

02-线性结构4 Pop Sequence   (25分) Given a stack which can keep MMM numbers at most. Push NNN nu...
• ccDLlyy
• 2016年09月25日 09:34
• 2122

## [PTA]02-线性结构4 Pop Sequence

Given a stack which can keep MM numbers at most. Push NN numbers in the order of 1, 2, 3, ..., N...

## PAT Perfect Sequence (25)

举报原因： 您举报文章：1051 Pop Sequence 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)