本文共 1452 字，大约阅读时间需要 4 分钟。

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 51 2 3 4 5 6 73 2 1 7 5 6 47 6 5 4 3 2 15 6 4 3 7 2 11 7 6 5 4 3 2

Sample Output:

YESNONOYESNO

 按照栈给出的原则进行模拟，模拟过程中判断是否超出栈大小的范围，模拟完后栈判断是否为空。 。。

代码如下：

#include 
   
    #include 
    
     #include 
     
      #include 
      
       #include 
       
        using namespace std;const int maxn=1005;int a[maxn];int m,n,k;stack
        
         s;void init(){ while (!s.empty()) s.pop();}int main(){ scanf("%d%d%d",&m,&n,&k); for (int i=0;i
         
          m) { flag=1; break; } while(!s.empty()&&s.top()==a[kk]) { kk++; s.pop(); } } if(!s.empty()) flag=1; if(flag) printf("NO\n"); else printf("YES\n"); } return 0;}
         
        
       
      
     
    
   

转载地址：http://ltaen.baihongyu.com/