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

C:

/*
 @Date    : 2017-12-08 20:10:08
 @Author  : 酸饺子 (changzheng300@foxmail.com)
 @Link    : https://github.com/SourDumplings
 @Version : $Id$
*/

/*
https://www.patest.cn/contests/pat-a-practise/1051
 */

#include <stdio.h>
#include <stdlib.h>

typedef struct STACK *Stack;
struct STACK
{
    int top;
    int *data;
    int maxsize;
};

int M, N, K;

int IsFull(Stack S)
{
    return S->top == S->maxsize - 1;
}

int IsEmpty(Stack S)
{
    return S->top == -1;
}

int Push(Stack S, int X)
{
    int flag;
    if (!IsFull(S))
    {
        flag = 1;
        S->data[++S->top] = X;
    }
    else
    {
        flag = 0;
    }
    return flag;
}

int Pop(Stack S)
{
    if (!IsEmpty(S))
    {
        return S->data[S->top--];
    }
    else
    {
        return 0;
    }
}

int Check(int seq[])
{
    Stack S;
    S = (Stack)malloc(sizeof(struct STACK));
    S->maxsize = M;
    S->top = -1;
    S->data = (int *)malloc(N * sizeof(int));
    int flag = 1;
    int i;
    int n = 1;
    for (i = 0; i < N; i++)
    {
        if (!flag)
        {
            break;
        }
        if (S->data[S->top] != seq[i])
        {
            for (; n <= N && n <= seq[i]; n++)
            {
                flag = Push(S, n);
                if (!flag)
                {
                    break;
                }
            }
        }
        flag = Pop(S);
        if (flag != seq[i])
        {
            flag = 0;
        }
    }
    free(S->data);
    free(S);
    return flag;
}

int main()
{
    scanf("%d %d %d", &M, &N, &K);
    int i, j;
    int seq[N];
    for (i = 0; i < K; i++)
    {
        for (j = 0; j < N; j++)
        {
            scanf("%d", &seq[j]);
        }
        if (Check(seq))
        {
            printf("YES\n");
        }
        else
        {
            printf("NO\n");
        }
    }
    return 0;
}