黄浙峰老师 • 18天前
using namespace std;
long long n,a[100005],q,x,mid;
int f(int z){
int l=1;
int r=n,mid;
while(l<=r){
mid=l+r>>1;
if(z<=a[mid]) r=mid-1;
else l=mid+1;
}
if(a[l]==z) return l;
else return -1;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
cin>>q;
while(q--){
scanf("%d",&x);
f(x);
cout<<f(x)<<" ";
}
return 0;
}
评论: