剪贴板

#include <bits/stdc++.h>

using namespace std;

int nn[1000000];
int qq[1000000];

int main()
{
int n,q,left,right,mid,i;
while(~scanf("%d%d",&n,&q))
{
for(i=0; i<n; i++)
scanf("%d",&nn[i]);
for(i=0; i<q; i++)
scanf("%d",&qq[i]);
for(i=0; i<q; i++)
if((nn[0]<=qq[i])||(qq[i]<=nn[n-1]))
{
left=0,right=n;
for(int j=0; j<n; j++)
{
mid=left+(right-left)/2;
if(nn[mid]qq[i])
{
qq[i]=-1;
break;
}
else if(nn[mid]<qq[i]) left=mid;
else right=mid;
}
}
for(i=0; i<q; i++)
{
if(qq[i]-1)
cout<<“no”<<endl;
else
cout<<“YES”<<endl;
}
}
return 0;
}