[SWEA-6730] 장애물 경주 난이도 - Java

 

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWefy5x65PoDFAUh&categoryId=AWefy5x65PoDFAUh&categoryType=CODE&problemTitle=&orderBy=PASS_RATE&selectCodeLang=ALL&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

문제: SWEA 6730번 장애물 경주 난이도 자바 풀이

난이도: D3

 

코드

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

		for(int test_case = 1; test_case <= T; test_case++)
		{
			int n = sc.nextInt();
            int arr[]=new int[n];
            int up=0;
            int down=0;
            int before=0;
            for(int i=0;i<n;i++){
                arr[i]=sc.nextInt();
            }
            before=arr[0];
            for(int i=1;i<n;i++){
               if(arr[i]>before){
                    if(up<arr[i]-before){
                        up=arr[i]-before;
                    }
                }else{
                    if(down<before-arr[i]){
                        down=before-arr[i];
                    }
                }
                before=arr[i];
            }
            System.out.println("#"+test_case+" "+up+" "+down);
		}
	}
}