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 <iostream>
#include <string>
#include <vector>
#include <algorithm>

using namespace std;


int main()
{

	int N;

	cin >> N;

	long min_a = 1000000000;
	long max_a = 0;
	long a;
	for (int ni = 0; ni < N; ni++) {
		cin >> a;
		if (a < min_a) {
			min_a = a;
		}
		else if (a > max_a) {
			max_a = a;
		}
		//min_a = min(min_a, a);
		//max_a = max(max_a, a);
	}

	printf("%d", max_a - min_a);

    return 0;
}