AcWing 2816. 判断子序列
原题链接
简单
作者:
NCpaste
,
2023-04-05 22:22:37
,
所有人可见
,
阅读 87
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int b[N];
int n, m;
int main ()
{
cin >> n >> m;
for (int i = 0; i < n; i ++)
{
int t = 0;
cin >> t;
a[i] = t;
}
for (int j = 0; j < m; j ++)
{
int t = 0;
cin >> t;
b[j] = t;
}
int ind1, ind2;
ind1 = ind2 = 0;
while(ind1 < n && ind2 < m)
{
if (a[ind1] == b[ind2])
{
ind1 ++;
ind2 ++;
}
else
{
ind2 ++;
}
}
if (ind1 == n)
{
printf ("Yes\n");
}
else
{
printf ("No\n");
}
}