CF676A.Nicholas and Permutation

普及/提高-

通过率：0%

AC君温馨提醒

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

题目描述

Nicholas has an array $a$ that contains $n$ distinct integers from $1$ to $n$ . In other words, Nicholas has a permutation of size $n$ .

Nicholas want the minimum element (integer $1$ ) and the maximum element (integer $n$ ) to be as far as possible from each other. He wants to perform exactly one swap in order to maximize the distance between the minimum and the maximum elements. The distance between two elements is considered to be equal to the absolute difference between their positions.

输入格式

The first line of the input contains a single integer $n$ ( $2<=n<=100$ ) — the size of the permutation.

The second line of the input contains $n$ distinct integers $a_{1},a_{2},...,a_{n}$ ( $1<=a_{i}<=n$ ), where $a_{i}$ is equal to the element at the $i$ -th position.

输出格式

Print a single integer — the maximum possible distance between the minimum and the maximum elements Nicholas can achieve by performing exactly one swap.

输入输出样例

输入#1
```
5
4 5 1 3 2
```
输出#1
```
3
```
输入#2
```
7
1 6 5 3 4 7 2
```
输出#2
```
6
```
输入#3
```
6
6 5 4 3 2 1
```
输出#3
```
5
```

说明/提示

In the first sample, one may obtain the optimal answer by swapping elements $1$ and $2$ .

In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap $7$ and $2$ .

In the third sample, the distance between the minimum and the maximum elements is already maximum possible, so we just perform some unnecessary swap, for example, one can swap $5$ and $2$ .

首页