题解 | 查找

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

bool BinarySearch(vector<int>&a,int b){
    int left = 0;
    int right = a.size()-1;
    while(left<=right){
        int mid = left + (right - left) / 2;
        if(a[mid]<b)    left=mid+1;
        else if(a[mid]>b) right=mid-1;
        else if(a[mid]==b) return true;
    }
    return false;
}

int main() {
    int n;
    while(cin>>n){
        vector<int> nums;
        for(int i=0;i<n;i++){
            int a;
            cin>>a;
            nums.push_back(a);
        }
        sort(nums.begin(),nums.end());
        int m;
        cin>>m;
        for(int i=0;i<m;i++){
            int target;
            cin>>target;
            cout<< (BinarySearch(nums, target) ? "YES":"NO")<<endl;
        }
    }
    return 0;
}