`
단순히 정렬해서 2칸씩 값을 비교함. 아래와 같이 놓으면 최적이 될 것이라 생각함
… 4 2 1 3 5 …
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class B11497 {
static int T,N;
static int arr[];
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringBuilder sb = new StringBuilder();
StringTokenizer st;
T = Integer.parseInt(br.readLine());
while(T-->0) {
N = Integer.parseInt(br.readLine());
st = new StringTokenizer(br.readLine());
arr = new int[N];
for (int i = 0; i < N; i++) {
arr[i] = Integer.parseInt(st.nextToken());
}
Arrays.sort(arr);
int max = 0;
for (int i = 0; i < N-2; i++) {
max = Math.max(max, arr[i+2] - arr[i]);
}
sb.append(max).append("\n");
}
System.out.println(sb);
}
}
|