Problem:
MathJax.Hub.Config({ tex2jax: { inlineMath: [["$","$"], ["\\(","\\)"]], processEscapes: true }});

Maximum Profit

You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.

Write a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .

Input

The first line contains an integer $n$. In the following $n$ lines, $R_t$ ($t = 0, 1, 2, ... n-1$) are given in order.

Output

Print the maximum value in a line.

Constraints

$2 \leq n \leq 200,000$

$1 \leq R_t \leq 10^9$

Sample Input 1

6
5
3
1
3
4
3

Sample Output 1

3

Sample Input 2

3
4
3
2

Sample Output 2

-1

Solution in Rust (judge verdict: Time Limit Exceeded)

#![allow(dead_code)]
use std::io;

fn main() {
    solve_d();
}

fn solve_d() {
    let mut n = String::new();
    io::stdin().read_line(&mut n).unwrap();
    let n = n.trim().parse::<usize>().unwrap();

    let mut min = 0;
    let mut diff = i32::min_value();
    let mut vv = vec![0; n];
    for i in 0..n {
        let mut v = String::new();
        io::stdin().read_line(&mut v).unwrap();
        vv[i] = v.trim().parse::<u32>().unwrap();

        for j in min..i {
            if diff <= (vv[i] as i32 - vv[j] as i32) {
                diff = vv[i] as i32 - vv[j] as i32;
                //println!("min: {:?}, diff: {}", j, diff);
                min = j;
            }
        }
    }
    /*
    println!(
        "vv[max]: {}, max: {:?}, vv[min]: {}, min: {}",
        vv[max], max, vv[min], min
    );
    */
    println!("{}", diff);
}