题目：二分查找

【题解】

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

int main()
{
    long int n;
    scanf("%d",&n);
    int a[n];
    for(int i=0;i<n;i++){//需要查找的序列a[] 
        scanf("%d",&a[i]);
    } 
    
    int x;
    scanf("%d",&x);
    int key[x];
    
    for(int i=0;i<x;i++){//需要查找的关键词 key[]
        scanf("%d",&key[i]);
        int l=0,r=n-1;int b=0;
        while(l<=r){
            int mid=l+((r-l)/2);
            if(a[mid]==key[i]) {
                b=1;
                printf ("%d\n",mid);
                break;    
            }
            else if(a[mid]>key[i]) r=mid-1;
            else if(a[mid]<key[i]) l=mid+1;
        } 
        if(b==0) printf ("Not Found\n");
    }     
    return 0;
 }