codeforces 676A Nicholas and Permutation

点击打开链接

A. Nicholas and Permutation

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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 a1, a2, ..., an (1 ≤ ai ≤ n), where ai is equal to the element at the i-th position.

Output

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

Examples

input

5
4 5 1 3 2

output

input

7
1 6 5 3 4 7 2

output

input

6
6 5 4 3 2 1

output

Note

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.

水题，直接找最大值和最小值的位置，判断把谁放到最边上。

#include <bits/stdc++.h>
using namespace std;
int main()
{int n;cin>>n;int a[110];cin>>a[1];int mi=a[1],ma=a[1],p=1,q=1;for(int i=2;i<=n;i++){cin>>a[i];if(a[i]<mi){mi=a[i];p=i;}if(a[i]>ma){ma=a[i];q=i;}}int w1=p-1,w2=n-p,w3=q-1,w4=n-q;int w=max(w1,w2);w=max(w,w3);w=max(w,w4);cout<<w<<endl;return 0;
}

codeforces 676A Nicholas and Permutation相关推荐

Codeforces Round #354 (Div. 2) A. Nicholas and Permutation
Nicholas and Permutation time limit : 1 second memory limit: 256 megabytes 题目连接: http://www.codeforc ...
codeforces 7.22 E Permutation Shift
codeforces 7.22 E Permutation Shift 给出一个1到n的排列,每次可以交换两个数,问在交换最多m次(m <= n/3)之后能不能得到由1 2 3 - n循环右移所 ...
【CodeForces - 124C】Prime Permutation（数学，思维，小结论）
题干: You are given a string s, consisting of small Latin letters. Let's denote the length of the stri ...
【CodeForces - 483C】Diverse Permutation（思维构造）
题干: Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of ndistinct posit ...
Codeforces 1754B.Kevin and Permutation
1754B.Kevin and Permutation 原题地址 For his birthday, Kevin received the set of pairwise distinct numbe ...
CodeForces 361B Levko and Permutation
题意:有n个数,这些数的范围是[1,n],并且每个数都是不相同的.你需要构造一个排列,使得这个排列上的数与它所在位置的序号的最大公约数满足 > 1,并且这些数的个数恰好满足k个,输出这样的一个排 ...
CodeForces - 351E Jeff and Permutation(贪心)
题目链接:点击查看题目大意:给出一个长度为 n 的序列,可以选择某些位置使得 a[ i ] = - a[ i ],问逆序对最少可以是多少题目分析:需要看出的一个关系就是,在某一对关系 ( i , ...
CodeForces - 1343F Restore the Permutation by Sorted Segments(思维)
题目链接:点击查看题目大意:现在有一个长度为 n 的排列 p ,但排列 p 暂时对我们保密,每个样例将会给出 n - 1 个排好序后的子段,换句话说,对于 r ∈ [ 2 , n ] ,存在一个 l ...
CodeForces - 618B Guess the Permutation(思维+构造)
题目链接:点击查看题目大意:先给出一个长度为n的序列ai,这个序列是1~n全排列中的其中一种,再给出一个n*n的矩阵,maze[i][j]=val代表min(ai,aj)=val,要求我们构造出原始 ...
CodeForces 785E Anton and Permutation 分块
题意: 有一个\(1 \sim n\)的排列\(A\),有\(q\)个询问: 交换任意两个元素的位置,求交换之后排列的逆序数分析: 像这种不太容易用线段树,树状数组维护的可以考虑分块每\(\sqr ...

codeforces 676A Nicholas and Permutation

codeforces 676A Nicholas and Permutation相关推荐

最新文章

热门文章