02-线性结构3 Pop Sequence

02-线性结构3 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

 

#include <iostream>
#define N 1001
///1440-1526
using namespace std;
int s[N]= {0};

int main()
{
    int m,n,k,t;
    int ik,jn,ii;
    int l,p;
    int mark;
    cin>>m>>n>>k;
    for (ik=0; ik<k; ik++)
    {
        p=0;
        l=1;
        mark=0;
        for (jn=0; jn<n; jn++)
        {
            cin>>t;
            if (mark!=0)
            {
                continue;
            }
            if (p==0||s[p]<t)
            {
                for (ii=l; ii<t; ii++)
                {
                    p++;
                    s[p]=ii;
                    if (p>m-1)
                    {
                        mark=1;
                    }
                }
                l=t+1;
            }
            else if (s[p]==t)
            {
                p--;
            }
            else if (s[p]>t)
            {
                mark=1;

            }
        }
        if (mark==0)
        {
            cout<<"YES"<<endl;
        }
        else
        {
            cout<<"NO"<<endl;
        }

    }
    return 0;
}