0.618最优分治

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;

const int dmax=101000;
int a[dmax],m,n;

int trunc(double x){
	return (int)x;
}

int find(int x){
	int l=1,r=n,mid;
	while (l<=r){
		mid=l+trunc((r-l)*0.618);
		if (a[mid]==x)
			return mid;
		else if (a[mid]>x)
			r=mid-1;
		else l=mid+1;
	}
	return -1;
}

int main(){
	int i,j,k;
	scanf("%d",&n);
	for (i=1;i<=n;i++)
		scanf("%d",&a[i]);
	scanf("%d",&m);
	for (i=1;i<=m;i++){
		scanf("%d",&k);
		printf("%d\n",find(k));
	}
	return 0;
}