[백준] 8582 Park - Dynamic Programming / Java

• 문제 링크

8582번: Park

 

• 풀이 코드

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));
        StringBuilder sb = new StringBuilder();

        int n = read();
        int[] arr = new int[n];
        int[][] cache = new int[n][2];

        cache[0][0] = arr[0] = read();
        for (int i = 1; i < n; i++) cache[i][0] = Math.max(cache[i - 1][0], arr[i] = read());

        cache[n - 1][1] = arr[n - 1];
        for (int i = n - 2; i >= 0; i--) cache[i][1] = Math.max(cache[i + 1][1], arr[i]);

        for (int[] pair : cache) sb.append(pair[0]).append(" ").append(pair[1]).append("\n");

        bw.write(sb.toString());
        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;
    }

}