POJ
来源:互联网 发布:校花级别的多漂亮知乎 编辑:程序博客网 时间:2024/06/08 19:37
When shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round? Long Street is a straight line, where all positions are integer. You pay for parking in a specific slot, which is an integer position on Long Street. Michael does not want to pay for more than one parking though. He is very strong, and does not mind carrying all the bags around.
Input
The first line of input gives the number of test cases, 1 ≤ t ≤ 100. There are two lines for each test case. The first gives the number of stores Michael wants to visit, 1 ≤ n ≤ 20, and the second gives their n integer positions on Long Street, 0 ≤ xi ≤ 99.
Output
Output for each test case a line with the minimal distance Michael must walk given optimal parking.
Sample Input
2
4
24 13 89 37
6
7 30 41 14 39 42
Sample Output
152
70
#include<iostream>#include<cstring>#define ll long long int #define INF 0x3f3f3f3fusing namespace std;int a[1000];int main(){ int n; while (cin >> n) { while (n--) { ll ans = 0; int m; cin >> m; int max = 0; int min = INF; for (int i = 0; i < m; i++) { cin >> a[i]; if (a[i] < min) min = a[i]; if (a[i] > max) max = a[i]; } ans = (max - min) * 2; cout << ans << endl; } } return 0;}
- POJ
- poj
- POJ
- POJ
- poj
- poj
- POJ
- POJ
- poj
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- POJ
- Prime Time 暴力打表
- HDUOJ 1027 Ignatius and the Princess II(next_permutation)
- sql带条件查找最小缺失编号
- 从基础出发:统计学习方法三要素
- Java之字符串String,StringBuffer,StringBuilder
- POJ
- IoC容器源码-容器的基础
- B
- 牛客网编程-二叉树的深度(java)
- Java线程基本概念及操作
- 使用eclipse时在jsp中使用el表达式报错的解决方法
- “智能高清”技术设想
- [编程题] 大整数相乘
- POJ 2080 Calendar