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
题目要求
一个堆栈可以随意push和pop,按照1 2 3 4…… N的顺序依次放入堆栈中,给定多个可能的弹出情况,判断它们的正确性
解题思路
对于1……N的序列,每个压入栈中,然后比较栈顶元素和序列中即将弹出的数据,如果相等则将栈顶元素弹出,如果还相等则继续弹出,如果最后n个元素都被弹出,则正确,否则错误
完整代码
#include<bits/stdc++.h>
using namespace std;
int m,n;
int check(int a[]){
stack<int> s;
int i,num=0;
for(i=1;i<=n;i++){
s.push(i);
if(s.size()>m) return 0;
while(!s.empty() && s.top() == a[num]){
s.pop();
num++;
}
}
if(num==n) return 1;
else return 0;
}
int main(){
int k,i,t;
int a[1010];
cin>>m>>n>>k;
while(k--){
for(i=0;i<n;i++) cin>>a[i];
if(check(a)) cout<<"YES\n";
else cout<<"NO\n";
}
return 0;
}