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 (GCC 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(void){
    int n,min,max;
    int a[105];
    scanf("%d",&n);
    for(int count=1;count<=n;count++){
        scanf("%d",&a[count]);
    }
    min=1000000050;
    max=0;

    for(int count2=1;count2<=n;count2++){
        if(a[count2]<=min){min=a[count2];}
        if(a[count2]>=max){max=a[count2];}   
    }
    printf("%d\n",abs(max-min));
}