整数二分总结
作者:
尽买没用的
,
2024-03-28 16:58:29
,
所有人可见
,
阅读 5
#include<iostream>
using namespace std;
const int N=1e5+10;
int q[N];
int n,m;
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;
}
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;
//这里不+1会死循环,如只有2 2时,l=2,r=2,mid=2,l=mid就会死循环
if (q[mid]<=x) l=mid;
else r=mid-1;
}
cout<<l<<endl;
}
}
return 0;
}