НачалоПодразделы
Другие разделы
| Тренировка 1 |
| Тренировка 3 |
| Тренировка 4 |
| Тренировка 5 |
Дата и время
17/11/2024 01:18:31
Тренировка 2
A. Phone List B. Cuckoo Hashing C.Optimal Parking D. Copying DNA E. Circle of Debt F. Full Tank? G. Nested Dolls H. Shopaholic I. Moogle
C.Optimal Parking
Олимпиадные задачи на английском языке| 04/02/2008 | Зима 2008 дорешивание (2C) |
| 05/02/2008 | Тренировка (задачи Nordic CPC 2007) (C) |
Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
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 specifications
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\ ≤\ x_i\ ≤\ 99`.
Output specifications
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
Output for sample input
152 70
