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

判断出栈顺序的合法性

第一行输入栈的最大容量M，和输入序列（1-N）最大值N 查询数K

接下来K行输入每次的出栈序列。

合法输出Yes

不合法输出No

这题就模拟出栈就行了，每次都做判断

#include<stack>
#include<iostream>
using namespace std;
int main()
{
    int K,N,M;//测试数据数，1-N，栈最大容量
    int j=0,k=0;
    int num[1010];
    cin>>K>>N>>M;
    for(int i=0;i<M;i++)
    {
        bool flag=true;
        stack<int> st;
        for(int i=1;i<=N;i++)
            cin>>num[i];//读入出栈序列数据
        k=1;
        for(j=1;j<=N;j++)
        {
            st.push(j);//j,压入栈
            //爆栈了
            if(st.size()>K)
            {
                flag=false;
                break;
            }
            //栈顶元素和当前数组的数字相同时 
            while (!st.empty()&&st.top()==num[k])
            {
                st.pop();
                k++;
            }
        }
        //栈空并且没有爆栈
        if(st.empty()&&flag)
            cout<<"YES"<<endl;
        //栈非空或者爆栈了
        else
            cout<<"NO"<<endl;
    }
    return 0;
}
/*
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

*/