AtCoder Beginner Contest 064
翻译中…
Problem Statement
翻译中…
It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.
There are $N$ houses along TopCoDeer street. The $i$-th house is located at coordinate $a_i$. He has decided to deliver gifts to all these houses.
Find the minimum distance to be traveled when AtCoDeer can start and end his travel at any positions.
翻译中…
Constraints
翻译中…
$1 ≤ N ≤ 100$$0 ≤ a_i ≤ 1000$$a_i$is an integer.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
N
a_1 a_2 ... a_N翻译中…
Output
翻译中…
Print the minimum distance to be traveled.
翻译中…
样例
Input #1
4
2 3 7 9
Output #1
7
The travel distance of $7$ can be achieved by starting at coordinate $9$ and traveling straight to coordinate $2$.
It is not possible to do with a travel distance of less than $7$, and thus $7$ is the minimum distance to be traveled.
Input #2
8
3 1 4 1 5 9 2 6
Output #2
8
There may be more than one house at a position.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。