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

 

SW Expert Academy

SW 프로그래밍 역량 강화에 도움이 되는 다양한 학습 컨텐츠를 확인하세요!

swexpertacademy.com

import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Solution {

	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;

		for (int testCase = 1; testCase <= 10; testCase++) {
			st = new StringTokenizer(br.readLine());
			int[] building = new int[Integer.parseInt(st.nextToken())];

			st = new StringTokenizer(br.readLine());
			for (int i = 0; i < building.length; i++) {
				building[i] = Integer.parseInt(st.nextToken());
			}

			int answer = 0;
			for (int i = 2; i < building.length - 2; i++) {
				int max = Math.max(building[i - 2],
						Math.max(building[i - 1], Math.max(building[i + 1], building[i + 2])));

				if (building[i] > max) {
					answer += building[i] - max;
				}
			}
			sb.append("#").append(testCase).append(" ").append(answer).append("\n");
		}
		System.out.println(sb);
	}
}

+ Recent posts