Nicholas and Permutation

原创 2016年06月01日 16:32:04

                                                                                  

                                                                                                    A. Nicholas and Permutation

Nicholas has an array a that containsn distinct integers from1 to n. In other words, Nicholas has a permutation of sizen.

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 integern (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 thei-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
3
Input
7
1 6 5 3 4 7 2
Output
6
Input
6
6 5 4 3 2 1
Output
5
Note

In the first sample, one may obtain the optimal answer by swapping elements1 and 2.

In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap7 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 swap5 and 2.


题意:

交换这个序列里面的两个数使最大的数和最小的数的距离最大,问这个最大的距离是多少;

思路:

把最大的和最小的分别和第一个和最后一个交换,最大的就是答案了;

AC代码:
#include<iostream>
#include<string.h>
#include<cmath>
#include<stdio.h>
#include<algorithm>
using namespace std;
int main()
{
	int a[101];
	int T;
	//int ma,mi,mid,dis;
	int Max,Min;
	while(cin>>T)
	{
		memset(a,0,sizeof(a));
		for(int i=1;i<=T;i++)
		{
			cin>>a[i];
			if(a[i]==1)
			Min=i;
			if(a[i]==T)
			Max=i;
		}
		//cout<<mi<<ma<<endl;
		if((Max-Min)==T-1)
		cout<<T-1<<endl;
		else
		{
			int ans=max(T-Min,T-Max);
			ans=max(ans,Min-1);
			ans=max(ans,Max-1);
			cout<<ans<<endl;
		}
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

codeforces 676A Nicholas and Permutation

A. Nicholas and Permutation time limit per test 1 second memory limit per test 256 megabytes inpu...

【Codeforces Round 354 (Div 2)A】【水题 贪心】Nicholas and Permutation 恰好交换一次的pos[n]-pos[1]

A. Nicholas and Permutation time limit per test 1 second memory limit per test 256 megab...

Codeforces Round #354 (Div. 2) A Nicholas and Permutation(水题)

http://codeforces.com/problemset/problem/676/A A. Nicholas and Permutation time limit per ...

【强连通分量】 HDOJ 4985 Little Pony and Permutation

求一下强连通分量就行。。。 #include #include #include #include #include #include #include #...

HDU4985&&bestcoder #7 1001 Little Pony and Permutation(水题)

Little Pony and Permutation Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (...

Anton and Permutation CF

#include #include #include using namespace std; #define N 200003 #define mid (l+r>>1) int sum[N*100...

Codeforce - 361 - B. Levko and Permutation

B. Levko and Permutation time limit per test1 second memory limit per test256 megabytes inputstan...

codeforces #309 553B B. Kyoya and Permutation(斐波那契数)

题目链接: 点击打开链接 题目大意: 定义一种排列的标准循环表示法,也就是排列中先按每个循环内部的从大到小排序,然后以每个循环的最大值从小到大排序,问存在的第k小的符合要求的排列 题目分析: ...

Codeforces Round #404 (Div. 2)E. Anton and Permutation(分块)

E. Anton and Permutation time limit per test4 seconds memory limit per test512 megabytes inputsta...

HDU 1027 Ignatius and the Princess II【STL- next_permutation全拍列】

题意:输入n和m,求1-n的第m个全排列。 有了STL的next_permutation,妈妈再也不用担心我会WA了。。。
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)