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
主要思想:
1.用栈模拟是否可以完成该顺序
2.如果栈顶小于数组[pPool]并且栈的大小小于M,则栈push下一位数
3.如果栈顶等于数组[pPool],pop
4.其他情况为不可能发生的情况,即NO的情况
5.用标志符flag来记录
代码:
#include<iostream>
#include<stack>
#include<vector>
using namespace std;
int main(){
int M,N,K;
scanf("%d %d %d",&M,&N,&K);
while(K--){
vector<int> pool(N,0);
for(int i=0;i<N;i++)
cin>>pool[i];//将序列存入pool数组中
stack<int> st;
int flag=0,pPool=0,num=1;//flag用来判断是否可行
while(pPool<N){
if(st.empty()){
st.push(num++);
}else{
if(pool[pPool]==st.top()){
st.pop();
pPool++;
}else if(pool[pPool]>st.top()){
if(st.size()==M){//栈满
flag=1;break;
}else{
st.push(num++);
}
}else{//top大于vector
flag=1;break;
}
}
}
if(flag)cout<<"NO"<<endl;
else{
cout<<"YES"<<endl;
}
}
return 0;
}