acwing算法基础模板 二分 acwing789数的范围

#include<iostream>
using namespace std;
const int N = 100010;
int q[N];

int de_search(int q[],int l,int r,int x)
{
	l -= 1;
	r += 1;
	while (l + 1 != r)
	{
		if (q[l + r >> 1] < x)
			l = (l + r >> 1);
		else
			r = (l + r >> 1);
	}
	if (q[r] == x) return r;
	else return -1;
}

int d2_search(int q[], int l,int r, int x)
{
	l-= 1;
	r += 1;
	while (l + 1 != r)
	{
		int mid = l + r >> 1;
		if (q[mid] <= x)
			l = mid;
		else
			r = mid;
	}
	if (q[l] == x) return l;
	else return -1;
}

int main()
{
	int m, n;
	cin >> m >> n;
	for (int i = 0; i < m; i++) cin >> q[i];
	while (n--)
	{
		int x;
		cin >> x;
		cout << de_search(q, 0, m - 1, x) << " " << d2_search(q, 0, m - 1, x);
		cout << endl;
	}

	return 0;
}