CodeForces - 924B Three-level Laser （二分搜索）

Three-level Laser

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

An atom of element X can exist in n distinct states with energies E1 < E2 < ... < En. Arkady wants to build a laser on this element, using a three-level scheme. Here is a simplified description of the scheme.

Three distinct states i, j and k are selected, where i < j < k. After that the following process happens:

1. initially the atom is in the state i,
2. we spend Ek - Ei energy to put the atom in the state k,
3. the atom emits a photon with useful energy Ek - Ej and changes its state to the state j,
4. the atom spontaneously changes its state to the state i, losing energy Ej - Ei,
5. the process repeats from step 1.

Let's define the energy conversion efficiency as , i. e. the ration between the useful energy of the photon and spent energy.

Due to some limitations, Arkady can only choose such three states that Ek - Ei ≤ U.

Help Arkady to find such the maximum possible energy conversion efficiency within the above constraints.

Input

The first line contains two integers n and U (3 ≤ n ≤ 105, 1 ≤ U ≤ 109) — the number of states and the maximum possible difference between Ek and Ei.

The second line contains a sequence of integers E1, E2, ..., En (1 ≤ E1 < E2... < En ≤ 109). It is guaranteed that all Ei are given in increasing order.

Output

If it is not possible to choose three states that satisfy all constraints, print -1.

Otherwise, print one real number η — the maximum possible energy conversion efficiency. Your answer is considered correct its absolute or relative error does not exceed 10 - 9.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if .

Examples

input

Copy

4 4
1 3 5 7

output

0.5

input

Copy

10 8
10 13 15 16 17 19 20 22 24 25

output

0.875

input

Copy

3 1
2 5 10

output

-1

Note

In the first example choose states 1, 2 and 3, so that the energy conversion efficiency becomes equal to .

In the second example choose states 4, 5 and 9, so that the energy conversion efficiency becomes equal to .

题意：在一串有序数列中，找到三个数,a[i]<a[j],a[k]，使得 (a[k]-a[j])/(a[k]-a[i])最大，其中 a[k]-a[i]要在U内

解题思路：枚举每第i个数 n，二分搜索 n+U的位置得到j，答案为 (a[j]-a[i+1])/(a[j]-a[i])

#include <iostream>
#include <string.h>
#include <memory.h>
#include <queue>
using namespace std;
const int inf = 0x3f3f3f3f;
typedef long long int ll;

long double a[100005];
int N,U;

int search(long double x){

	int l=0,r=N;
	int m=0;
	while(l<r){
		m=(l+r)/2;
		if(x>=a[m]){
			l=m+1;
		}
		else
			r=m;
	}
	if(N==l)
		return N-1;
	return l-1;
}

int main()
{
	
	scanf("%d%d",&N,&U);
	for(int i=0;i<N;i++)
		cin>>a[i];

	long double maxx=-100;
	for(int i=0;i<N-2;i++){
		int j=search(a[i]+U);
		if(j-i<2)
			continue;
		
		maxx=max(maxx,(a[j]-a[i+1]*1.0)/(a[j]*1.0-a[i]));
	//	cout<<i<<" "<<j<<endl;
	}
	if(maxx==-100)
	cout<<-1<<endl;
	else
	printf("%.15Lf",maxx);
	
	

	return 0;
}