1051.Pop Sequence java

 

import java.util.*;

/*
  M (the maximum capacity of the stack),
  N (the length of push sequence),
  K (the number of pop sequences to be checked).
* */
public class Main {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        int m=scanner.nextInt();
        int n=scanner.nextInt();
        int k=scanner.nextInt();
        for (int i=0;i<k;i++){
            int a[]=new int[n];
            for (int index = 0; index < n; index++) {
                a[index] = scanner.nextInt();
            }
            Stack<Integer>stack=new Stack<>();
            stack.clear();//下一次为stack赋值要将前一次的数据清除
            int index=0;
            int flag=1;
            for (int j=1;j<=n;j++){//注意从1开始
                stack.push(j);//stack每次输入顺序都一样，但不一定是一次输完
                if (stack.size()>m){//超过了最大容量
                    flag=0;
                    break;
                }
                while (!stack.isEmpty()&&stack.peek()==a[index]){
                    index++;
                    stack.pop();
                }
            }
            if (stack.isEmpty()&&flag==1){//全部能匹配且不超容量
                System.out.println("YES");
            }else {
                System.out.println("NO");
            }
        }
    }
}

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