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# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;

namespace B___Maximum_Difference
{
    class Program
    {
        static void Main(string[] args)
        {
            var n =int.Parse( Console.ReadLine());
            var input = Console.ReadLine().Split(' ');
            var a = new int[n];
            var b = 0;
            for (var i = 0; i < n; i++)
            {
                a[i] = int.Parse(input[i]);
            }
            for(var i=0; i<n-1; i++)
            {
                for(var j=1; j<n; j++)
                {
                   if(b< Math.Abs(a[i]-a[j]))
                    {
                        b = Math.Abs(a[i] -a[j]);
                    }
                }
            }
            Console.WriteLine(b);
           
        }
    }
}