[SW Expert Academy] 장애물 경주 난이도 (D3)

https://swexpertacademy.com/main/solvingProblem/solvingProblem.do

SW Expert Academy

 

import java.util.Scanner;

class Solution {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			int n = sc.nextInt();

			int maxUp = 0;
			int minDown = 0;

			int[] height = new int[n];

			for (int i = 0; i < n; i++) {
				height[i] = sc.nextInt();
			}

			for (int i = 0; i < n - 1; i++) {
				if (height[i + 1] - height[i] > 0)
					maxUp = Math.max(height[i + 1] - height[i], maxUp);
				else
					minDown = Math.max(Math.abs(height[i + 1] - height[i]), minDown);

			}
			
			System.out.println("#"+tc+" "+maxUp+" "+minDown);

		}

	}
}

 

else 구문은 아래처럼 바꾸는 것도 좋을 것 같다.

	else
		minDown = Math.max(height[i]-height[i+1], minDown);