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

import java.util.*;
public class Solution {
    public static void main(String[] args) {
        
        Scanner s = new Scanner(System.in);
        
        for(int tc=1;tc<=10;tc++) {
            int n = s.nextInt();
            int[] map = new int[n];
            
            for(int i=0;i<n;i++) {
                map[i]=s.nextInt();
            }
            
            int ans = 0;
            for(int i=2;i<map.length-2;i++) {
 
                int[] arr = new int[4];
                arr[0] = map[i-1];
                arr[1] = map[i-2];
                arr[2] = map[i+1];
                arr[3] = map[i+2];
                Arrays.sort(arr);
                if(arr[3]<map[i]) {
                    ans += (map[i]-arr[3]);
                }
            }
            System.out.println("#"+tc+" "+ans);
        }
    }
}