整数二分查找模板

• 工具：VS2022
• 前提是一一个单调数组

#include<iostream>
using namespace std;
const int N = 1e6+10;
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 le=0,r=n-1;
while(le<r)
{
int mid=(le+r)>>1;
if(q[mid]>=x)r=mid;
else le=mid+1;
}
if(q[le]!=x)cout<<"-1 -1"<<endl;
else 
{
cout<<le<<" ";
int le=0,r=n-1;
while(le<r)
{
int mid=(le+r+1)>>1;
if(q[mid]<=x)le=mid;
else r=mid-1;
}
cout<<le<<endl;
}
}
return 0;
}