Acwing 2816. 判断子序列

题目描述

代码展示

#include

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;
    for(int j = 0;j < m; j++)
    {
        if(i < n && a[i] == b[j])  i++;
    }
    if(i == n) puts("Yes");
    else puts("No");
    return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25