CF1734A.Select Three Sticks

入门

通过率:0%

时间限制:1.00s

内存限制:256MB

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given nn sticks with positive integral length a1,a2,…,ana_1, a_2, \ldots, a_n.

You can perform the following operation any number of times (possibly zero):

  • choose one stick, then either increase or decrease its length by 11. After each operation, all sticks should have positive lengths.

What is the minimum number of operations that you have to perform such that it is possible to select three of the nn sticks and use them without breaking to form an equilateral triangle?

An equilateral triangle is a triangle where all of its three sides have the same length.

给你 nn 根长度为正整数的木棍,其长度分别为 a1,a2,…,ana_1, a_2, \ldots, a_n。

你可以执行以下操作任意多次(包括零次):

  • 选择一根木棍,将其长度增加或减少 11。每次操作后,所有木棍的长度必须仍为正整数。

你需要执行的最少操作次数是多少,才能使得从这 nn 根木棍中选出三根,不折断地组成一个等边三角形?

等边三角形是指其三条边长度均相等的三角形。

输入格式

The first line of the input contains a single integer tt (1≤t≤1001 \le t \le 100) — the number of test cases. The description of the test cases follows.

The first line of each test case contains a single integer nn (3≤n≤3003 \le n \le 300) — the number of sticks.

The second line of each test case contains nn integers a1,a2,…,ana_1, a_2, \ldots, a_n (1≤ai≤1091 \le a_i \le 10^9) — the lengths of the sticks.

It is guaranteed that the sum of nn over all test cases does not exceed 300300.

输入的第一行包含一个整数 tt(1≤t≤1001 \le t \le 100),表示测试用例的数量。随后是各测试用例的描述。

每个测试用例的第一行包含一个整数 nn(3≤n≤3003 \le n \le 300),表示木棍的数量。

每个测试用例的第二行包含 nn 个整数 a1,a2,…,ana_1, a_2, \ldots, a_n(1≤ai≤1091 \le a_i \le 10^9),表示各木棍的长度。

保证所有测试用例的 nn 值之和不超过 300300。

输出格式

For each test case, print one integer on a single line — the minimum number of operations to be made.

对于每个测试用例,在一行中输出一个整数——所需执行的最少操作次数。

输入输出样例

  • 输入#1

    4
    3
    1 2 3
    4
    7 3 7 3
    5
    3 4 2 1 1
    8
    3 1 4 1 5 9 2 6

    输出#1

    2
    4
    1
    1

说明/提示

In the first test case, you can increase the length of the first stick by 11, then decrease the length of the third stick by 11. In total, you perform 22 operations, such that the three sticks form an equilateral triangle of side length 22.

In the fourth test case, you can decrease the length of the seventh stick by 11. An equilateral triangle of side length 11 can be selected and formed by the second, fourth, and seventh sticks.

在第一个测试用例中,你可以将第一根木棍的长度增加 11,然后将第三根木棍的长度减少 11。总共执行 22 次操作,使得这三根木棍构成一个边长为 22 的等边三角形。

在第四个测试用例中,你可以将第七根木棍的长度减少 11。此时可选取第二、第四和第七根木棍,构成一个边长为 11 的等边三角形。

输入解题思路,AI测评打分。不知道怎么写?

首页