[SWEA] 1206 : View

https://swexpertacademy.com/main/talk/solvingClub/problemView.do?solveclubId=AV6kld8aisgDFASb&contestProbId=AV134DPqAA8CFAYh&probBoxId=AV-HZfeqN3ADFASP&type=PROBLEM&problemBoxTitle=%5BD2~D3+%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4%5D+%EA%B8%B0%EC%B4%88+%EB%8B%A4%EC%A7%80%EA%B8%B0+Part3&problemBoxCnt=14 

SW Expert Academy

배열로 풀었고 현재 탐색 중인 인덱스의 왼쪽과 오른쪽의 요소들 2개씩 모두가 현재 인덱스보다 작음을 충족시켰을 때 가장 차이가 적은 값을 더해주며 완전탐색해준다.

 

[내 코드]

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Solution {
 
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringBuilder sb = new StringBuilder();
        StringTokenizer st;
         
        for(int t = 1; t <= 10; t++) {
            sb.append('#').append(t).append(' ');
            int result = 0;
             
            int N = Integer.parseInt(br.readLine());
            int[] height = new int[N];
            st = new StringTokenizer(br.readLine());
            for(int n = 0; n < N; n++) {
                height[n] = Integer.parseInt(st.nextToken());
            }
             
            for(int i = 2; i < N -2; i++) {
                int min = 256;
                if(height[i] > height[i - 2] && height[i] > height[i - 1] && height[i] > height[i + 1] && height[i] > height[i + 2]) {
                        min = Math.min(min, height[i] - height[i - 2]);
                        min = Math.min(min, height[i] - height[i - 1]);
                        min = Math.min(min, height[i] - height[i + 1]);
                        min = Math.min(min, height[i] - height[i + 2]);
                         
                        result += min;
                }
            }
            sb.append(result).append('\n');
        }
        System.out.print(sb);
    }
 
}