Array Stabilization

1000ms

262144K

Description:

You are given an array $$$a$$$ consisting of $$$n$$$ integer numbers.

Let instability of the array be the following value: $$$\max\limits_{i = 1}^{n} a_i - \min\limits_{i = 1}^{n} a_i$$$.

You have to remove exactly one element from this array to minimize instability of the resulting $$$(n-1)$$$-elements array. Your task is to calculate the minimum possible instability.

Input:

The first line of the input contains one integer $$$n$$$ ($$$2 \le n \le 10^5$$$) — the number of elements in the array $$$a$$$.

The second line of the input contains $$$n$$$ integers $$$a_1, a_2, \dots, a_n$$$ ($$$1 \le a_i \le 10^5$$$) — elements of the array $$$a$$$.

Output:

Print one integer — the minimum possible instability of the array if you have to remove exactly one element from the array $$$a$$$.

Sample Input:

4
1 3 3 7

Sample Output:

Sample Input:

2
1 100000

Sample Output:

Note:

In the first example you can remove $$$7$$$ then instability of the remaining array will be $$$3 - 1 = 2$$$.

In the second example you can remove either $$$1$$$ or $$$100000$$$ then instability of the remaining array will be $$$100000 - 100000 = 0$$$ and $$$1 - 1 = 0$$$ correspondingly.

Informação

Provedor Codeforces

Código CF1095B