模版题——判断子序列

题目：活动 - AcWing

#include<bits/stdc++.h>
#define int long long
typedef long long ll;
using namespace std;
const int N = 2e5 + 10;
const int mod  = 998244353;
int mp[N];
void solve(){
    int n,m;
    cin>>n>>m;
    vector<int> a(n+1,0),b(m+1,0);
    for (int i = 1; i <= n; ++i) {
        cin>>a[i];
    }
    for (int i = 1; i <= m; ++i) {
        cin>>b[i];
    }
    int j = 1;  //a数组的下标
    for (int i = 1; i <= m; ++i) {      //枚举b数组的每一个元素，如果b[i] == a[j],则j++
        if(j <= n && b[i] == a[j]) j++;
    }
    if(j == n+1) cout<<"Yes";   //如果j == n+1 就证明，a是b的子序列
    else cout<<"No";
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    //cin>>t;
    while(t--){
        solve();
    }
    return 0 ;
}