[백준] 31448 Ascending hike - Greedy / Java

• 문제 링크

https://www.acmicpc.net/problem/31448

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int n = read(), i = read(), j = i, max = 0;
        while (n-- > 1) {
            int k = read();
            if (j < k) max = Math.max(max, k - i);
            else i = k;
            j = k;
        }

        bw.write(String.valueOf(max));
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return n;
    }

}