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: Runtime Error)

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char *argv[]){
    int max,min,N;
    int i;
    int j=0;
    int k=0;
    int l=0;
    int array[100000];
    char buf[256];
    char num[10];
    scanf("%d",&N);
    fgets(buf, 255, stdin);
    scanf("%[^\n]", buf);
    for(i=0; buf[i]!='\0'; i++){
        if(buf[i]==' '){
            array[k] = atoi(num);
            k++;
            for(l=0; l<j; l++){
                num[l]=0;
            }
            j=0;
        }
        else{
            num[j]=buf[i];
            j++;
        }
    }
    array[k] = atoi(num);
    k++;
    for(i=0; i<k; i++){
        if(i==0){
            min=array[0];
            max=array[0];
        }
        else if(array[i]>max){
            max=array[i];
        }
        else if(array[i]<min){
            min=array[i];
        }
    }
    printf("%d\n",max-min);
}