#472 C. Three-level Laser

最新推荐文章于 2026-06-17 16:44:27 发布

原创最新推荐文章于 2026-06-17 16:44:27 发布 · 409 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

Codefocres 同时被 2 个专栏收录

9 篇文章

订阅专栏

贪心

5 篇文章

订阅专栏

本文探讨了在特定能量状态及限制条件下，如何通过选择合适的状态来构建三能级激光系统，以实现最大化的能量转换效率。介绍了算法思路并提供了具体的实现代码。

C. 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 E₁ < E₂ < ... < E_n. 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 E_k - E_i energy to put the atom in the state k,
the atom emits a photon with useful energy E_k - E_j and changes its state to the state j,
the atom spontaneously changes its state to the state i, losing energy E_j - E_i,
the process repeats from step 1.

Let's define the energy conversion efficiency as $\text{[math]}$ , 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 E_k - E_i ≤ 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 ≤ 10⁵, 1 ≤ U ≤ 10⁹) — the number of states and the maximum possible difference between E_k and E_i.

The second line contains a sequence of integers E₁, E₂, ..., E_n (1 ≤ E₁ < E₂... < E_n ≤ 10⁹). It is guaranteed that all E_i 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 $\text{[math]}$ .

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 $\text{[math]}$ .

In the second example choose states 4, 5 and 9, so that the energy conversion efficiency becomes equal to $\text{[math]}$ .

题意：给出迁跃的范围和每一阶的能量，求最大的能量利用率

思路：根据分数的性质，a、b(b>a)相差最小时 (m-b)/(m-a) 可以取最大

所以a、b应该为相邻的两个数，即求使(m-a[i])/(m-a[i-1])最大的m

同样根据分数的性质，m越大所求的值就越大，根据m的约束条件(m-a[i-1])<=u

所以m为使得(m-a[i-1])最接近u的值；

这里我们可以预处理一下，用数组c储存对应满足条件的m，降低时间的复杂度

ac代码

#include<bits/stdc++.h>

using namespace std;

int n;
int a[100005];
int c[100005];
int k;//题目中的u

int main()
{
    scanf("%d %d",&n,&k);
    for(int i = 0; i < n; i++)
    {
        scanf("%d",&a[i]);
    }
    memset(c,0,sizeof(c));

    int cnt = 0;
    for(int i = 1; i < n; i++)
    {
        if(a[i] - a[cnt] > k)//预处理，c[i]储存对应的下标（m+1）
        {
            c[cnt++] = i;
            i--;
        }
    }

    double so  = 0;
    for(int i = 1; i < n-1; i++)
    {
        double temp;
        if(c[i-1] != 0 && c[i-1] < n)
        {
            temp = (double)(a[c[i-1]-1] - a[i])/(a[c[i-1]-1] - a[i-1]);
            so = max(so,temp);
            continue;
        }
    double   ans = (double)(a[n-1] - a[i])/(a[n-1]-a[i-1]);//对最后一个数进行判断，这是为了防止最后一个数满足题意但没有被存到c中
                                                        
 so = max(so,ans);

    }

    if(so == 0)
        printf("-1\n");
    else
        printf("%.20lf\n",so);//控制输出精度
    return 0;
}