#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
int q[N];
int main()
{
int n,m;
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)/2;
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)
{
int mid=(l+r+1)/2;
if(q[mid]<=x)l=mid;
else
r=mid-1;
}
cout<<l<<endl;
}
}
}
二分法(两个模板)
猜你喜欢
转载自blog.csdn.net/m0_74153798/article/details/131790340
今日推荐
周排行