AcWing 789. 数的范围
原题链接
简单
C++ 代码
#include <iostream>
using namespace std;
const int N = 1e5 + 10;
int n, q;
int g[N];
void t_find(int g[], int tar)
{
int l = 0, r = n - 1;
while(l < r)
{
int mid = (l + r) >> 1;
if(g[mid] >= tar) r = mid;
else l = mid + 1;
}
if(g[l] == tar) cout << l << ' ';
else cout << -1 << ' ';
l = 0, r = n - 1;
while(l < r)
{
int mid = (l + r + 1) >> 1;
if(g[mid] > tar) r = mid - 1;
else l = mid;
}
if(g[l] == tar) cout << l << ' ' << endl;
else cout << -1 << ' ' << endl;
}
int main()
{
scanf("%d %d", &n, &q);
for(int i = 0; i < n; i++) scanf("%d", &g[i]);
while(q --)
{
int num;
scanf("%d", &num);
t_find(g, num);
}
return 0;
}