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 Java (OpenJDK 11.0.6) (judge verdict: Accepted)


import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;

public class Main{

	public static void main(String[] args) throws IOException {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));


		int n 	     = Integer.parseInt(br.readLine());
		long max     = 0;
		long[] list  = new long[n];
		String[] tmp = br.readLine().split(" ");

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

			list[i] = Long.parseLong(tmp[i]);

		}

		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {

				max = Math.max(Math.abs(list[i] - list[j]), max);
			}
		}
		System.out.println(max);
	}
}