题解 | 查找

//KY198 查找
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
int n, m;
int a[100005];

int main()
{
    while(cin>>n)
    {
        for(int i=1;i<=n;i++) cin>>a[i];
        sort(a+1,a+n+1);
        cin>>m;
        for(int i=1;i<=m;i++){
            int x;
            cin>>x;
            int l=1,r=n;
            while(l<=r)
            {
                int mid=(l+r)>>1;
                if(x==a[mid]) {cout<<"YES\n";break;}
                else if(x<a[mid]) r=mid-1;
                else l=mid+1;
            }
            if(l>r) cout<<"NO\n";
        }
    }
    return 0;
}