SWEA 6730 장애물 경주 난이도

1 개요

SWEA 6718 희성이의 원근법

SW Expert 아카데미

#	문제	풀이

3 Java

import java.util.*;
public class Solution {
	static Scanner sc = new Scanner(System.in);
	public static void main(String[] args) {
		int T = sc.nextInt();
		for(int tc=1; tc<=T; tc++) {
			int N = sc.nextInt();
			int[] a = new int[N];
			for(int i=0; i<N; i++) a[i] = sc.nextInt();
			int maxUp = 0;
			int maxDown = 0;
			for(int i=0; i<N-1; i++) {
				int diff = a[i+1] - a[i];
				if( diff > 0 ) {
					if( diff > maxUp ) maxUp = diff;
					continue;
				}
				if( diff < 0 ) {
					if( diff < -maxDown ) maxDown = -diff;
				}
			}
			System.out.format("#%d %d %d\n", tc, maxUp, maxDown);
		}
	}
}