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++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

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

int main(void){
    char row[1000];
    char *tok;
    int max;
    int min;
    printf("%s", "整数列をスペース区切りで入力: ");
    scanf("%s", row);
    tok = strtok(row, ",");
    max = atoi(tok);
    min = atoi(tok);
    while(tok != NULL){
        int pointer = atoi(tok);
        if(max < pointer){
            max = pointer;
        }
        if(min > pointer){
            min = pointer;
        }
        tok = strtok(NULL, ",");
    }
    int dif = max - min;
    printf("%d\n", dif);
    return 0;
}