简单查找

5 345 56 23 6 56633 66 63 22934 235 555555 230 0

no

no

yes

yes

no

思路：快排+二分查找。

#include<stdio.h>  
#include<algorithm>  
using namespace std;  
int a[3333333];  
int main()  
{  
    int n,m,b;  
    while(scanf("%d%d",&n,&m)!=EOF)  
    {  
        if(m==0&&n==0)  
            return 0;  
        int i,j;  
        for(i=0;i<n;i++)  
            scanf("%d",&a[i]);  
        sort(a,a+n);  
        int flag=0;  
        for(j=0;j<m;j++)  
        {  
            flag=0;  
            scanf("%d",&b);   
            int left=0,right=n-1,mid;  
            while(left<=right)  
            {  
                mid=(left+right)/2;  
                if(b==a[mid])  
                {  
                    printf("yes\n");  
                    flag=1;  
                    break;  
                }  
                if(b>a[mid])  
                    left=mid+1;  
                else
                    right=mid-1;  
            }  
            if(flag==0)  
                printf("no\n");  
        }  
    }  
    return 0;  
}
 
yes
no