Widest Gap

Difficulty: 1100 3000 ms 128 MB

sorting

Sort the values; print the largest difference between consecutive sorted values (0 when N = 1).

Input: the first line has N; the second line has N integers.

Output: the maximum adjacent gap after sorting.

Constraints:

• 1 ≤ N ≤ 10⁵
• −10⁹ ≤ a_i ≤ 10⁹

Sample Tests

4
1 7 3 10

4

1
5

0

Read the Editorial