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;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace AtCoder102
{
    class Program
    {
        static void Main(string[] args)
        {
            int n = int.Parse(Console.ReadLine());
            int max, min;
            string[] a = null;
            int[] intArray = null;
            a = Console.ReadLine().Split(new char[] { ' ' });
            intArray = new int[a.Length];
            for (int i = 0; i < a.Length; i++)
            {
                intArray[i] = int.Parse(a[i]);
            }
            max = intArray[0];
            min = intArray[0];
            for (int i = 1; i < intArray.Length; i++)
            {
                if (intArray[i] > max) max = intArray[i];
                if (intArray[i] < min) min = intArray[i];
            }
            Console.WriteLine(max - min);
        }
    }
}