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 Rust (1.15.1) (judge verdict: Accepted)

use std::cmp;

struct MyIo{

}

impl MyIo{
    fn readline()->Vec<String>{
        let mut buf = String::new();
        std::io::stdin().read_line(&mut buf).unwrap();
        let ret:Vec<String> = buf.split_whitespace().map(|c|c.to_string()).collect();
        ret
    }
}


fn main() {

    let mut input = MyIo::readline().into_iter();
    let N = input.next().unwrap().parse::<u32>().unwrap();
    let mut values = MyIo::readline().into_iter();
    let max = values.clone().map(|v| v.parse::<u32>().unwrap()).fold(0,|acc ,x| cmp::max(acc,x));
    let min = values.map(|v| v.parse::<u32>().unwrap()).fold(1000000000,|acc ,x| cmp::min(acc,x));
    println!("{:?}",max-min);

}