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

---

算法思路：建立一个栈模拟入栈与出栈过程，在使用栈比较时至少保证有一个元素，如果读入的数小于栈顶元素（肯定不可能，输出NO），如果读入的数为栈顶元素，则栈顶指针指向下一个数，继续判断，如果读入的数大于栈顶元素，继续压入元素。如果栈中元素大于给定容量，直接跳出，此时i一定小于n，即输出NO，如果所有的数都满足要求则输出yes。

注意：栈为空，需要压入一个数；栈溢出，输出也是NO。

#include<bits/stdc++.h>
using namespace std;

void isPopSeq(const vector<int>& arr,const int& m){
    stack<int> stk;
    int n=arr.size();
    int num=1;
    stk.push(num);
    int i=0;
    for(;i<n;i++){
        if(arr[i]<stk.top()) break;
        while(arr[i]>stk.top()) stk.push(++num);
        if(stk.size()>m) break;
        if(arr[i]==stk.top()) stk.pop();
        if(stk.size()==0) stk.push(++num);
    }
    if(i==n) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
}

int main(){
    int m,n,k;
    cin>>m>>n>>k;
    vector<int> arr(n,0);
    for(int i=0;i<k;i++){
        for(int j=0;j<n;j++) cin>>arr[j];
        isPopSeq(arr,m); 
    }
    return 0;
}