鸡鸡爆超级无敌无脑复制粘贴模板手撕题解

#include<iostream>
using namespace std;
int main(){
	int n,a[100005],data[100005],l,r,mid,ans=-1;
	cin >>n;
	for(int i=1;i<=n;i++) cin >> a[i];
	int m;
	cin >> m;
	for(int i=1;i<=m;i++) cin >> data[i];
	for(int i=1;i<=m;i++){
		l=1;
		r=n;
		while(l<=r){
			mid=(l+r)/2;
			if(a[mid]>=data[i]){
				ans = mid;
				r=mid-1;
			}
			else{
				l=mid+1;
			}
		}
		if(ans == -1){
			cout << "-1" << ' '; 
		}else{
			if(a[ans] == data[i]){
				cout <<  ans << ' ';
			}else {
				cout << "-1" << ' '; 
			}
		}
		l=1;
		r=n;
		while(l<=r){
			mid=(l+r)/2;
			if(a[mid]<=data[i]){
				ans = mid;
				l=mid+1;
			}
			else{
				r=mid-1;
			}
		}
		if(ans == -1){
			cout << "-1" << ' '; 
		}else{
			if(a[ans] == data[i]){
				cout <<  ans << ' ';
			}else {
				cout << "-1" << ' '; 
			}
		}
		l=1;
		r=n;
		while(l<=r){
			mid=(l+r)/2;
			if(a[mid]>data[i]){
				ans = mid;
				r=mid-1;
			}
			else{
				l=mid+1;
			}
		}
		if(ans == -1){
			cout << "-1" << ' '; 
		}else{
			if(a[ans] > data[i]){
				cout <<  ans << ' ';
			}else {
				cout << "-1" << ' '; 
			}
		}
		cout << endl;
	}
	
	return 0;
}