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 (Clang 3.8.0) (judge verdict: Wrong Answer)

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

int max = 0;
int min = 1000000000;

int main(int argc, char *argv[]){
    int N = 0;
    printf("N = ");
    char buf[128];
    fgets(buf, 128, stdin);
    sscanf(buf, "%d", &N);

    char x[128],*ch;

    fgets(x, 128, stdin);

    ch = strtok(x," \n");
    int a[N];

    for(int i = 0; i < N; i++){
        if (ch == NULL){
            break;
        } else {
            a[i] = atoi(ch);
        }
        ch = strtok(NULL," \n");

    }

    for(int i = 0; i < N; i++){

        if(a[i] > max){
            max = a[i];
        }
        if(a[i] < min){
            min = a[i];
        }
    }
    int dif;
    dif = max - min;
    printf("%d\n", dif);

}