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:
- initially the atom is in the state i,
- we spend Ek - Ei energy to put the atom in the state k,
- the atom emits a photon with useful energy Ek - Ej and changes its state to the state j,
- the atom spontaneously changes its state to the state i, losing energy Ej - Ei,
- 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.
OutputIf 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 .
Examples4 4 1 3 5 7
0.5
10 8 10 13 15 16 17 19 20 22 24 25
0.875
3 1 2 5 10
-1
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 .
题意: 给定n个严格递增的数(E[1],E[2],...,E[n]),从中任意找三个数,设下标分别为i,j,k,要求E[i]、E[j]、E[k]相互之间的差值都小于U,且i<j<k,问(E[k]-E[j])/(E[k]-E[i])的最大值是多少,若不存在这样的i,j,k,则输出-1。因为数组是递增的,我们当然希望在满足a[k]-a[i-1]<=U的情况下,取相邻的两个元素,a[i]及a[i-1],这样就达到了比值最大的情况(因为这样数值最接近1,在分数中最接近1的情况便是最优解)加上二分搜索,不断更新最优解就是最后答案。
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 1e5+10;
int arr[N];
int main(){
int n,U;
scanf("%d%d",&n,&U);
for(int i=1;i<=n;i++)
scanf("%d",&arr[i]);
double ans=-1;
for(int i=2;i<=n-1;i++){
if(arr[i+1]-arr[i-1]>U) continue;
int l=i+1,r=n;
while(l<=r){
int mid=(l+r)>>1;
if(arr[mid]-arr[i-1]<=U) l=mid+1;
else r=mid-1;
}
ans=max(ans,1.0*(arr[r]-arr[i])/(arr[r]-arr[i-1]));
}
if(ans<-0.5) printf("-1\n");
else printf("%.10f\n",ans);
return 0;
}