重写了一一次。主要是想写二分。。。
#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=100005;
int arr[maxn];
bool bsearch(int low ,int high ,int k)
{
int mid;
while(low<=high)
{
mid=(low+high)/2;
if(arr[mid]==k)
return true;
else if(arr[mid]<k)
low=mid+1;
else
high=mid-1;
}
return false;
}
int main()
{
int n,q,i,k;
while(scanf("%d%d",&n,&q))
{
if(!n && !q) break;
for(i=0;i<n;++i)
scanf("%d",&arr[i]);
sort(arr,arr+n);
for(i=0;i<q;++i)
{
scanf("%d",&k);
if(bsearch(0,n-1,k))
printf("YES\n");
else
printf("NO\n");
}
}
return 0;
}