AcWing789.数的范围

最新推荐文章于 2022-05-04 12:25:39 发布

「已注销」

最新推荐文章于 2022-05-04 12:25:39 发布

阅读量266

点赞数

分类专栏： AcWing算法基础文章标签：算法 c++ 二分法

本文链接：https://blog.csdn.net/optimjie/article/details/103602973

版权

AcWing算法基础专栏收录该内容

5 篇文章 0 订阅

订阅专栏

题目链接

#include<iostream>
using namespace std;
const int N = 100010;
int q[N];
int n, m;
int main()
{
	cin >> n >> m;
	for (int i = 0; i < n; i++)
		scanf("%d", &q[i]);
	while (m--)
	{
		int x;
		scanf("%d", &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)
			cout << "-1 -1" << endl;
		else
		{
			cout << l << " ";
			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 << l << endl;
		}
	}
	return 0;
}