[SWEA] 장애물 경주 난이도

 

 

[문제]

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWefy5x65PoDFAUh

SW Expert Academy

 

 

 

[소스 코드]

import java.io.*;
import java.util.*;
public class Solution {
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st;
		int T = Integer.parseInt(br.readLine());
		for(int tc=1;tc<=T;tc++) {
			int n = Integer.parseInt(br.readLine());
			int[] h = new int[n];
			st = new StringTokenizer(br.readLine());
			for(int i=0;i<n;i++) {
				h[i] = Integer.parseInt(st.nextToken());
			}
			int down = 0;
			int up = 0;
			for(int i=0;i<n-1;i++) {
				if(h[i]<h[i+1]) up = Math.max(up, h[i+1]-h[i]);
				if(h[i]>h[i+1]) down = Math.max(down, h[i]-h[i+1]);
			}
			System.out.println("#"+tc+" "+up+" "+down);
		}
	}
}