考研机试真题--查找--北京邮电大学

题目链接：
https://www.nowcoder.com/practice/d93db01c2ee44e8a9237d63842aca8aa?tpId=40&tqId=21531&tPage=1&rp=1&ru=/ta/kaoyan&qru=/ta/kaoyan/question-ranking

思路：二分查找

代码：

#include <cstdio>
#include <fstream>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 110;

int  main(){
//    freopen("a.txt", "r", stdin);
    int n, m, x;
    int a[maxn];
    while(cin >> n){
        for(int i = 0; i < n; ++i){
            cin >> a[i];
        }
        sort(a, a + n);
        cin >> m;
        for(int i = 0; i < m; ++i){
            bool flag = false;
            cin >> x;
            int begin = 0, end = n - 1;
            while(begin <= end){
                int mid = begin + (end - begin) / 2;
                if(a[mid] == x){
                    cout << "YES"<<endl;
                    flag = true;
                    break;
                }
                else if(a[mid] < x){
                    begin = mid + 1;
                }
                else{
                    end = mid - 1;
                }
            }
            if(!flag) cout << "NO" <<endl;
        }
    }


    return 0;
}