二分性质:单调性质或者区间性质
https://www.acwing.com/problem/content/description/791
bool check(int x) {/* ... */} // 检查x是否满足某种性质
// 区间[l, r]被划分成[l, mid]和[mid + 1, r]时使用:
int bsearch_1(int l, int r)
{
while (l < r)
{
int mid = l + r >> 1;
if (check(mid)) r = mid; // check()判断mid是否满足性质
else l = mid + 1;
}
return l;
}
// 区间[l, r]被划分成[l, mid - 1]和[mid, r]时使用:
int bsearch_2(int l, int r)
{
while (l < r)
{
int mid = l + r + 1 >> 1;
if (check(mid)) l = mid;
else r = mid - 1;
}
return l;
}
-----------------------------------------
```cpp
#include <bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int a[maxn],n,m,k;
int main()
{
ios::sync_with_stdio(false);
cin >> n >> m;
for(int i=0;i<n;i++)
cin >> a[i];
while(m--)
{
cin >> k;
int l=0,r=n-1,mid;
while(l<r)
{
mid=(l+r)>>1;//左区间 正常
if(a[mid]>=k)
r=mid;
else
l=mid+1;
}
if(a[l]!=k)
printf("-1 -1\n");
else
{
printf("%d ",l);
int l=0,r=n-1;
while(l<r)
{
mid=(l+r+1)>>1;//右区间 +1
if(a[mid]<=k)
l=mid;
else
r=mid-1;
}
printf("%d\n",l);
}
}
return 0;
}