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

//#define ABS(X) ((X > 0) ? (X) : (-1 * X))
#define ABS(Value) ((Value < 0) ? (Value * -1) : (Value))


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

int main(void)
{
	int N;
	int *A;
	int max_diff;
	int current;
	int i;
	int j;

	printf("2以上100以下の整数Nを入力：");

	scanf("%d", &N);
	A = (int *)malloc(sizeof(int) + N);
	if (!A){
		printf("malloc error\n");
		return (0);
	}
	i = 0;
	while (i < N){
		printf("%d:", i + 1);
		scanf("%d", &A[i]);
		i++;
	}
	max_diff = 0;

	i = 0;
	while (i < N - 1){
		j = i + 1;
		while (j < N){
			current = A[i] - A[j];
			if (ABS(current) > max_diff){
				max_diff = ABS(current);
			}
			j++;
		}
		i++;
	}
	printf("%d\n", max_diff);
	free(A);
	return (0);
}