1051 Pop Sequence （25 分）C语言

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

代码

#include<stdio.h>
#define MAX 1009
int M;//size of stack
int N;//size of number
int K;//size of lines
int st[MAX],top=0,now=1;
//stack:1-M; top: now loc, 0 respect no element;
int pushseq[MAX][MAX];
int seq(int *);
int main(){
    int i,j;
    scanf("%d %d %d",&M,&N,&K);
    for(i=0;i<K;i++)
        for(j=0;j<N;j++) scanf("%d",&pushseq[i][j]);
     for(i=0;i<K;i++){
        //init stack
        top=0;now=1;
        if( seq(pushseq[i]) ) printf("YES\n");
        else printf("NO\n");
    }
}
int seq(int *pushseq){
    int i;//delete
    while( !top || *pushseq>st[top])
            st[++top]=now++;
    //now top get max
    if(top>M || *pushseq<st[top]) return 0;
    // *pushseq==st[top] pop element
    top--;pushseq++;

    if(*pushseq) seq(pushseq);
    else return 1;
}