65,187
社区成员




#include<iostream.h>
using namespace std;
int seek(int *p,int high,int mu){
int low=0;
int mid;
while(low<=high){
mid = (low+high)/2;
if(p[mid]==mu){//查找到
return mid+1;
}else if(p[mid]<mu){
high = mid-1;
}else{
low = mid+1;
}
}
return 0;
}
int main(void)
{
int n,i,t,m;
cin>>n;
int *a = new int[n];
for(i=0;i<n;i++)
cin>>a[i];
cin>>t;
while(t--){
cin>>m;
cout<<seek(a,n-1,m)<<endl;
}
delete []a;
return 0;
}