A12346 | Array Stabilization
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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$ .
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$ .
输出格式
Print one integer — the minimum possible instability of the array if you have to remove exactly one element from the array $a$ .
输入输出样例
输入 #1
4 1 3 3 7
输出 #1
2
输入 #2
2 1 100000
输出 #2
0
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.
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.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted