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: Time Limit Exceeded)

#include <stdio.h>
int main(){
	int n;
	scanf("%d", &n);
	int v[n];
	int cont = n;
	while(n != 0){
		int i;
		scanf("%d", &i);
		v[n-1] = i;
		printf("%d\n", v[n-1]);
		n--;
	}
	int sla;
	int ini = 0;
	unsigned int max = 0;
	while(cont != 0){
		printf("%d", sla);
		while(cont >= 0){ 	
			int xablau = 0;
			xablau = sla - v[ini];
			ini += 1;
			if(xablau > max)
				max = xablau;
		}
	}
	
	printf("%d \n", max);
	return 0;
}