AcWing 789. 数的范围
原题链接
简单
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int n,m;
int q[N];
int main(){
scanf("%d%d",&n,&m);
for(int i = 0; i < n; i ++)scanf("%d", &q[i]);
while(m--){
int x;
scanf("%d",&x);
int l = 0, r = n - 1 ;
while(l<r){//模板1
int mid = ( l + r ) / 2;//(l+r)>>1;
if(q[mid] >= x)r=mid;
else l = mid + 1;
}
if(q[l] != x){
cout<<"-1 -1"<<endl;
}else{
cout<<l<<' ';
int l = 0, r = n - 1;
while(l < r){//模板2
int mid = ( l + r + 1) / 2;
if(q[mid] <= x)l = mid;
else r = mid - 1;
}
cout<<l<<endl;
}
}
return 0;
}