P2249 【深基13.例1】查找

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 5;
int a[N], b[N];
int n, m, x;

int BinSearch(int x){
	int L = 1, R = n;
	
	while(L < R){
		int mid = (L + R) / 2;
		if(a[mid] >= x)
			R = mid;
		else
			L = mid + 1; 
	}
	if(a[L] == x)
		return L;
	else
		return -1; 
}

int main(){
	ios::sync_with_stdio(false);	//使cin更快 
	cin.tie(nullptr);
	
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	for(int i = 1; i <= m; i++)
		cin >> b[i];
	for(int i = 1; i <= m; i++)
		cout << BinSearch(b[i]) << " ";
	return 0;
}