双指针算法
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int n, m;
int a[N], b[N];
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> a[i];
for (int i = 0; i < m; i ++ ) cin >> b[i];
int i = 0, j = 0;
while (i < n && j < m) //从前往后遍历a,b序列
{
if (a[i] == b[j]) i ++ ; //匹配时,短序列指针加1
j ++ ; //每次迭代长序列指针加1
}
if (i == n) puts("Yes"); //短序列每个元素都匹配完则输出Yes
else puts("No");
return 0;
}