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

using namespace std;

int main(){
    int n;
    cin>>n;
    // vector<int> ar(n , 0);
    int max=0 , min = 9999999;
    for(int i =0; i< n; i ++)
    {
        int temp;
        cin>>temp;
        if( temp > max ){

            max = temp;
            continue;
        }
        if ( temp < min ){

            min = temp;
            continue;
        }
    }
    cout<<max - min ;
    return 0;
}