BEAKJOON JAVA ALGORITHM #10819(차이를 최대로)

https://www.acmicpc.net/problem/10819

import java.util.Arrays; import java.util.Scanner; public class a10819 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int num = sc.nextInt(); int[] arr = new int[num]; for(int i=0; i<num; i++) { arr[i] = sc.nextInt(); } Arrays.sort(arr); int temp = 0; while(nextArr(arr)) { int result = cal(arr); temp = Math.max(temp, result); } System.out.println(temp); } public static int cal(int[] arr) { int sum = 0; for(int i=0; i<arr.length-1; i++) { sum = sum + Math.abs(arr[i] - arr[i+1]); } return sum; } public static boolean nextArr(int[] arr) { int i = arr.length-1; while(i>0 && arr[i-1] >= arr[i]) { i--; } if(i <= 0) { return false; } int j = arr.length-1; while(j >= i && arr[j] <= arr[i-1]) { j--; } int temp = arr[i-1]; arr[i-1] = arr[j]; arr[j] = temp; j = arr.length-1; while(i < j) { temp = arr[i]; arr[i] = arr[j]; arr[j] = temp; i++; j--; } return true; } }