Traveling AtCoDeer Problem

AtCoder

IDabc064_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

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.

API Response (JSON)

{
  "problem": {
    "name": "Traveling AtCoDeer Problem",
    "description": {
      "content": "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 coordinat",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc064_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "It is only six months until Christmas, and AtCoDeer the reindeer is now planning his travel to deliver gifts.  \nThere are $N$ houses along _TopCoDeer street_. The $i$\\-th house is located at coordinat...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments