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<cstdio>
#include<cstring>
#include<stack>
#include<vector>
using namespace std;
const int Max=1005;
stack<int> s;
int main()
{
int M,N,K,Arr[Max],x;
scanf("%d %d %d",&M,&N,&K);
for(int i=0; i<N; i++)
Arr[i]=i+1;
vector<int> Temp;
vector<int> v;
while(K--)
{
Temp.clear();
v.clear();
for(int i=0; i<N; i++)
{
scanf("%d",&x);
Temp.push_back(x);
}
int index=0;
for(int i=0; i<N; i++)
{
if(s.size()==M)
continue;
s.push(Arr[i]);
while(s.top()==Temp[index])
{
v.push_back(s.top());
s.pop();
index+=1;
if(s.empty())
break;
}
}
while(!s.empty())
{
v.push_back(s.top());
s.pop();
}
if(v==Temp)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}