1051 Pop Sequence (25分)（非正规解法）

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

ple Output:

YES
NO
NO
YES
NO

题目给出了栈大小，序列大小和序列数量，判断出栈顺序是否合法。
正解应该是模拟栈，但刚开始没想到这个，反而因为看到题目是要判断出栈合法性而想到了其他非正规解法…
出栈序列合法，要求序列中每一个元素后方的元素中比该元素小的元素递减排列，从反面看，即要求从后往前是递增序列，若出现逆序，如2，3这样的，那么在2之前不得有比3大的，否则不合法，所以从后往前判断是否出现上述情况即可。
而且由于给定了栈大小和序列大小，所以序列长度大于栈时，有些元素不能出现在序列靠前的位置。

#include<iostream>
#include<string>
#include<map>
#include<iterator>
#include<iomanip>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<stack>
#include<cmath>
#include <utility>
#define INF 0x7f7f7f7f
typedef long long ll;
using namespace std;

int main() {
    int n, m, k;
    cin >> n >> m >> k;
    int seat = m - n;
    int* line = new int[m];
    for (int x = 0; x < k; x++) {
        memset(line, 0, sizeof(line));
        int flag1 = 0, flag2 = 0;
        for (int i = 0; i < m; i++)
            cin >> line[i];
        for (int i = 0; i < seat; i++) {
            if (line[i] > (n+i)) {
                flag1 = 1;
                break;
            }
        }
        if (flag1)
            cout << "NO" << endl;
        else {
            int tmp1 = m - 1, tmp = 0;
            while(1) {
                for (int i = tmp1; i > 0; i--) {
                    if (line[i] > line[i - 1] && !flag2) {
                        flag2 = 1;
                        tmp = i;
                    }
                    if (line[tmp] < line[i] && flag2) {
                        flag1 = 1;
                        break;
                    }
                }
                if (tmp == 0)
                    break;
                else if (flag1)
                    break;
                else {
                    tmp1 = tmp - 1;
                    tmp = 0;
                    flag2 = 0;
                }
            }
            if (flag1)
                cout << "NO" << endl;
            else
                cout << "YES" << endl;
        }
    }
    return(0);
}