题解 | #查找#

# include <bits/stdc++.h>
using namespace std;

const int MAXN = 100 + 10;
int arr[MAXN];

bool binary_serch(int n, int target) {
    int left = 0, right = n - 1;
    while (left <= right) {
        int middle = (left + right) / 2;
        if (arr[middle] < target)left = middle + 1;
        else if (arr[middle] > target)right = middle - 1;
        else return true;
    }
    return false;
}

int main() {
    int m = 0;
    while (scanf("%d", &m) != EOF) {
        for (int i = 0; i < m; i++) {
            scanf("%d", &arr[i]);
        }
        sort(arr, arr + m);
        int n = 0;
        scanf("%d", &n);
        for (int i = 0; i < n; i++) {
            int taget = 0;
            scanf("%d", &taget);
            if (binary_serch(m, taget))cout << "YES" << endl;
            else cout << "NO" << endl;
        }
    }
    return 0;
}