789. 数的范围
先用二分求出x的左边界——a[mid] >= x(mid在x的右边,所以右边界变为mid)
即:
if(a[mid] >= x) r = mid;
else l = mid + 1;
根据模板得出mid
mid = l + r >> 1;
若得出的左边界值不为x,则满足x不存在与数组中,输出“-1 -1”
若等于x,二分求右边界——a[mid] <= x(mid在x的左边,所以左边界变为mid)
即:
if(a[mid] <= x) l = mid;
else r = mid - 1;
对应的mid为
mid = l + r + 1 >> 1;
具体代码
#include<bits/stdc++.h>
using namespace std;
const int N =100010;
int a[N],n,m;
int main(){
scanf("%d %d",&n,&m);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
while(m--){
int x;
scanf("%d",&x);
int l = 0,r = n - 1;
while(l < r){
int mid = l + r >> 1;
if(a[mid] >= x) r = mid;
else l = mid + 1;
}
if(a[l] != x) cout<<"-1 -1"<<endl;
else{
cout<<l<<' ';
int l = 0,r = n - 1;
while(l < r){
int mid = l + r + 1 >> 1;
if(a[mid] <= x) l = mid;
else r = mid - 1;
}
cout<<l<<endl;
}
}
return 0;
}