Problem:
Score : 200 points

Problem Statement

You are given an integer sequence A of length N.
Find the maximum absolute difference of two elements (with different indices) in A.

Constraints

2 \leq N \leq 100

1 \leq A_i \leq 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

Print the maximum absolute difference of two elements (with different indices) in A.

Sample Input 1

4
1 4 6 3

Sample Output 1

5

The maximum absolute difference of two elements is A_3-A_1=6-1=5.

Sample Input 2

2
1000000000 1

Sample Output 2

999999999

Sample Input 3

5
1 1 1 1 1

Sample Output 3

0

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections.Generic;

namespace ABC102B
{
    public class B_MaximumDifference
    {
        static void Main(string[] args)
        {
            var N = int.Parse(Console.ReadLine());
            var ai = Console.ReadLine();
            Console.WriteLine(CalcMaximumDiff(N, ai));
        }

        public static int CalcMaximumDiff(int N, string Ai)
        {
            var aiArray =  Ai.Split(' ');
            var intAiArray = new List<int> { };

            for (int i = 0; i < N; i++)
            {
                intAiArray.Add(int.Parse(aiArray[i]));
            }
            var result = 0;

            // 配列を昇順ソートし、1番目の要素と、最後の要素の差を返す
            intAiArray.Sort();
            result = intAiArray[^1] - intAiArray[0]; 

            return result;
        }
    }
}