题解 | 验证栈序列

#include<bits/stdc++.h>
using namespace std;
int main(){
    
    int q;
    cin>>q;
    for(int i=1;i<=q;i++){
        int n;
        vector<int> in;
        vector<int> pg;
        stack<int> out;
        cin>>n;
        for(int k=0;k<n;k++){
            int a;
            cin>>a;
            in.push_back(a);
        }for(int k=0;k<n;k++){
            int b;
            cin>>b;
            pg.push_back(b);
        }
        int num=1e9+7;
        int o=0;
        for(int k=0;k<n;k++){
            out.push(in[k]);
            num=out.top();
            if(num==pg[o]){
                while(!out.empty()&&num==pg[o]){
                out.pop();
                o++;
                num=out.top();
                }
            }
        }
        if(out.empty()){
            cout<<"Yes"<< endl;
        }else{
            cout<<"No"<< endl;
        }
       
    } return 0;
}