AcWing 789. 数的范围
原题链接
简单
作者:
我要出去乱说
,
2021-01-24 10:53:00
,
所有人可见
,
阅读 290
#include <iostream>
using namespace std;
const int N = 1e6 + 10;
int q[N];
int n, m;
int main()
{
cin >> n >> m;
for (int i = 0; i < n; i ++ ) cin >> q[i];
while (m -- )
{
int x;
cin >> 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) printf("-1 -1\n"); //循环结束l == r
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 << r << endl;
}
}
return 0;
}