[SWEA] 1206 [S/W 문제해결 기본] 1일차 - View Java

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AV134DPqAA8CFAYh&categoryId=AV134DPqAA8CFAYh&categoryType=CODE&problemTitle=&orderBy=RECOMMEND_COUNT&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

[코드]

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {

	public static void main(String[] args) throws IOException {
		Scanner sc = new Scanner(System.in);
        for (int test_case = 1; test_case <= 10; test_case++) {
            int N = sc.nextInt();
            int[] array = new int[N];
            for (int i = 0; i < N; i++) {
                array[i] = sc.nextInt();
            }
            int count = 0; // 조망권 확보된 세대 수
            for (int i = 2; i < N - 2; i++) {
                int max = Math.max(array[i - 2], Math.max(array[i - 1], Math.max(array[i + 1], array[i + 2]))); // 2칸 이내
                                                                                                                // 최대값
                if (array[i] - max > 0) {
                    count += array[i] - max;
                }
            }
            System.out.println("#" + test_case + " " + count);
        }
	}
}