1051 Pop Sequence@PTA

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

在有序序列[1,n]中设置一个指针num，指示<=num的值都已经入栈。

遍历给定的k序列，当num<a[i]时，表示<=a[i]的值都是要入栈的，这时我们更新num=a[i],并且将num之前的值都入栈，同时要判断是不是会爆栈。

类似于重新模拟了入栈的过程，然后比较元素。

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <algorithm>
#define MAXN 10004

using namespace std;

stack<int> sta;

bool solve(int *a,int n,int m){
    while(!sta.empty()) sta.pop();
    int num = 1;
    for(int i=0;i<n;++i){
        while(num <= a[i]){
            sta.push(num++);
            if(sta.size() > m) return false;
        }
        if(sta.top() == a[i]){
            sta.pop();
        }
        else return false;
    }
    return true;
}

int main(){
    int m,n,k;
    int a[1004];
    while(cin >> m >> n >> k){
        while(k--){
            for(int i=0;i<n;++i) cin >> a[i];
            if(solve(a,n,m)) cout << "YES" << endl;
            else cout << "NO" << endl;
        }
    }
	return 0;
}