一、B. Honest Coach

本题链接：B. Honest Coach

题目：

B. Honest Coach

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

There are n athletes in front of you. Athletes are numbered from 1 to n from left to right. You know the strength of each athlete — the athlete number i has the strength si.

You want to split all athletes into two teams. Each team must have at least one athlete, and each athlete must be exactly in one team.

You want the strongest athlete from the first team to differ as little as possible from the weakest athlete from the second team. Formally, you want to split the athletes into two teams A and B so that the value |max(A)−min(B)| is as small as possible, where max(A) is the maximum strength of an athlete from team A, and min(B) is the minimum strength of an athlete from team B.

For example, if n=5 and the strength of the athletes is s=[3,1,2,6,4], then one of the possible split into teams is:

first team: A=[1,2,4],
second team: B=[3,6].
In this case, the value |max(A)−min(B)| will be equal to |4−3|=1. This example illustrates one of the ways of optimal split into two teams.

Print the minimum value |max(A)−min(B)|.

Input
The first line contains an integer t (1≤t≤1000) — the number of test cases in the input. Then t test cases follow.

Each test case consists of two lines.

The first line contains positive integer n (2≤n≤50) — number of athletes.

The second line contains n positive integers s1,s2,…,sn (1≤si≤1000), where si — is the strength of the i-th athlete. Please note that s values may not be distinct.

Output
For each test case print one integer — the minimum value of |max(A)−min(B)| with the optimal split of all athletes into two teams. Each of the athletes must be a member of exactly one of the two teams.

Example
input
5
5
3 1 2 6 4
6
2 1 3 2 4 3
4
7 9 3 1
2
1 1000
3
100 150 200
output
1
0
2
999
50

Note
The first test case was explained in the statement. In the second test case, one of the optimal splits is A=[2,1], B=[3,2,4,3], so the answer is |2−2|=0.

本博客给出本题截图：

题意：把一个数组分成两个数组A和B，求|max(A)−min(B)|的最小值

AC代码

#include <iostream>
#include <algorithm>using namespace std;const int N = 55;int a[N];int main()
{int t;cin >> t;while (t -- ){int n;cin >> n;for (int i = 0; i < n; i ++ ) cin >> a[i];sort(a, a + n);int res = a[1] - a[0];for (int i = 1, j = 2; j < n; i ++, j ++ )res = min(res, a[j] - a[i]);cout << res << endl;}return 0;
}

总结

水题，不解释

Honest Coach相关推荐

Honest Coach CodeForces - 1360B(简单贪心)
题目: 把所给的数组分成a和b两个子数组(元素不重复使用),令a数组的的最大值和b数组的最小值的差最小,并输出. 题意: There are n athletes in front of you. A ...
Codeforces Round #644 (Div. 3)（A-E）
这场的A-E都是水题,就简单记录一下吧. Minimal Square CodeForces - 1360A 思路:我们令b=max(a,b),a=min(a,b). 如果b>=2*a的话,最终 ...
Codeforces Round #644(Div. 3) A-H
A - Minimal Square 题意给两个完全一样的矩形(平行且不重叠) 求能覆盖两个矩形的最小正方形的面积思路只有两种摆放方式将两个矩形上下并列或者左右并列得到的新图形长或者宽是之 ...
[CTO札记]高效能辅导(Coach)转摘
昨天的<与下属共同成长的'16字辅导真言'>谈的是管理中的'下属辅导'.蔡啸的一篇Blog(高效Coach培训整理(一)),记录了<高效能辅导>培训课程的心得.鉴于内容精要,图 ...
不合法的媒体文件 id_注意！伦敦男孩、DKNY、Coach、地素... 这些品牌的服装，抽检不合格...
此次质量抽查包括36家企业销售的54个奢侈服装品牌,不合格项目涉及pH值.附件抗拉强力.色牢度.可萃取重金属等强制性标准. 其中,BOY London的一款开衫连帽卫衣耐干摩擦色牢度不达标,另一款卫衣 ...
coach和mentor，教练和导师的区别
今天晚上我向我的妹妹介绍了我最近在公司参加的教练相关的培训计划,我妹妹是一位在希腊圣域拥有超过十年青铜圣斗士教学经验的白银圣斗士,在圣域担任导师工作,负责青铜圣斗士的mentoring. 我用我两都熟 ...
蔻驰和mk哪个更大牌_mk和coach哪个好？mk和coach包包是一个档次吗？
说到包包,mk和coach可谓是轻奢界的两大巨头了.因此,两个品牌的包包不可避免的会被经常拿来作比较.那么,从各个角度来讲mk和coach那款包包更好呢?这两款包包又有哪些本质上的区别呢? mk和co ...
【英语学习】【Daily English】U11 Work L02 Just be honest
文章目录 Word Preparation workload:工作量 first thing tomorrow:明天的第一件事 just be honest:实话实说 You sound stress ...
COACH与得物App达成官方合作未来计划提供专供款商品
5月9日消息,奢侈品牌COACH宣布与得物App达成官方合作.COACH官方入驻得物App后,除了提供包括手袋.皮具.配饰在内的专柜同步款外,未来还计划为得物App上的用户提供专供款商品. 据介绍,此 ...

Honest Coach

文章目录

一、B. Honest Coach

总结

Honest Coach相关推荐

最新文章

热门文章