A11294 | $Too Min Too Max$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Given an array $a$ of $n$ elements, find the maximum value of the expression: $$$$|a_i - a_j| + |a_j - a_k| + |a_k - a_l| + |a_l - a_i| $$ </p><p>where $i$ , $j$ , $k$ , and $l$ are four <span class="tex-font-style-bf">distinct</span> indices of the array $a$ , with $1 \\le i, j, k, l \\le n$ .</p><p>Here $|x|$ denotes the absolute value of $x$$$.

The first line contains one integer $t$ ( $1 \le t \le 500$ ) — the number of test cases. The description of the test cases follows. The first line of each test case contains a single integer $n$ ( $4 \le n \le 100$ ) — the length of the given array. The second line of each test case contains $n$ integers $a_1, a_2, \ldots, a_n$ ( $-10^6 \le a_i \le 10^6$ ).

For each test case, print a single integer — the maximum value.

输入 #1

5
4
1 1 1 1
5
1 1 2 2 3
8
5 1 3 2 -3 -1 10 3
4
3 3 1 1
4
1 2 2 -1

输出 #1

C++ 编辑器

输入

输出