AcWing 789. 数的范围
原题链接
简单
作者:
超无敌暴龙战士
,
2022-12-09 18:57:08
,
所有人可见
,
阅读 169
#include<iostream>
using namespace std;
const int N = 10000010;
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)
{
int mid = (l+r)>>1;
if(q[mid]>=x) r = mid;
else l = mid +1;
// cout<<"l每次"<<l<<endl;
}
if(q[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(q[mid]<=x) l = mid;
else r = mid - 1;
}
cout<<l<<endl;
}
}
return 0;
}