Three-level Laser CodeForces - 956B

Three-level Laser

题目链接：CodeForces - 956B
题意：由小到大排列的一个数列e[]，找到(ek-ej)/(ek-ei)的最大值， 且i<j<k&&ek-ei<=U;
ei,ej的差越小越好，ek,ej的差越大越好，那么ei,ej一定靠在一起，剩下的任务就是找到ek; 二分找ek，使得ek满足ek-ej最大且ek-ei<=U;

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <stack>
using namespace std;
const int maxn=100100;
int n, u;
int e[maxn];
int main(){
	while(~scanf("%d%d", &n, &u)){
		for(int i=0; i<n; i++)
			scanf("%d", &e[i]);
		getchar();
		double ans=0.0;
		int flag=0;
		for(int i=1; i<n-1; i++){
			int left=i+1, right=n-1;
			while(left+1<right){
				
				int mid=(left+right)>>1;
				if(e[mid]-e[i-1]<=u) left=mid;
				else right=mid-1;
			}
			if(left<right&&e[right]-e[i-1]<=u) left+=1; 
			if(e[left]-e[i-1]<=u){
				flag=1;
				double x=(double)(e[left]-e[i])/(double)(e[left]-e[i-1]);
				if(x-ans>0.00000000000) ans=x;
				//cout << i-1 << ' ' << left << ' ' << right  << ' ' << x << endl;
			}
		}
		if(flag)
			printf("%.9lf\n", ans);
		else printf("-1\n");
	}
	return 0;
}