2816. 判断子序列
题目链接https://www.acwing.com/problem/content/2818/
题目:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=1e5+10;
int a[N],b[N];
int main(){
int n,m;
cin>>n>>m;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
for(int j=0;j<m;j++)
scanf("%d",&b[j]);
int i=0,j=0;
bool flag=0;
while(i<n&&j<m){
if(a[i]==b[j]){
i++,j++;
}else{
j++;
}
if(i==n){
flag=1;
break;
}
}
if(flag) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
return 0;
}