关闭

CodeForces 676A Nicholas and Permutation

153人阅读 评论(0) 收藏 举报
分类:
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
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 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.

题意:给你1到n的n个数,任意交换两个数的位置,使最小值和最大值的距离最大,问最大距离是多少。
思路:要使距离最大,就要把最大或最小值放第一个或最后一个,分别求出这几种情况取最大值即可。
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{
	int n,i,j,k,l,m,a[1100];
	while(scanf("%d",&n)!=EOF)
	{
		for(i=1;i<=n;i++)
		{
			scanf("%d",&a[i]);
			if(a[i]==1)
			k=i;
			if(a[i]==n)
			l=i;
		}
		int a=max(l-1,k-1);
		int b=max(n-l,n-k);
		int c=max(abs(k-l),b);
		int d=max(c,a);
		printf("%d\n",d); 
	}
	return 0;
}


0
0
查看评论
发表评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】【232 in total】

Codeforces 题目合集+分类+蒟蒻的代码 【Updating...】
  • my_sunshine26
  • my_sunshine26
  • 2017-07-29 23:42
  • 1405

CF 482A(Diverse Permutation-相邻距离不同数为k的1~n全排列构造)

A. Diverse Permutation time limit per test 1 second memory limit per test 256 megabytes ...
  • nike0good
  • nike0good
  • 2014-10-31 11:42
  • 1860

codeforces 158B Taxi(贪心小水题)

B. Taxi 点击打开题目 time limit per test 3 seconds memory limit per test 256 megabytes input...
  • u012860428
  • u012860428
  • 2014-05-26 18:57
  • 1603

codeforces 676A Nicholas and Permutation

A. Nicholas and Permutation time limit per test 1 second memory limit per test 256 megabytes inpu...
  • EventQueue
  • EventQueue
  • 2016-05-26 21:36
  • 190

【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...
  • snowy_smile
  • snowy_smile
  • 2016-05-27 13:18
  • 528

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

http://codeforces.com/problemset/problem/676/A A. Nicholas and Permutation time limit per ...
  • qq_32866009
  • qq_32866009
  • 2016-06-01 13:11
  • 326

Codeforces 676D Theseus and labyrinth【模拟+Bfs】

D. Theseus and labyrinth time limit per test 3 seconds memory limit per test 256 megabytes ...
  • mengxiang000000
  • mengxiang000000
  • 2017-03-11 20:12
  • 115

Codeforces 676D Theseus and labyrinth

题目链接:http://codeforces.com/problemset/problem/676/D 题意:一个n×m的地图,每个房间向四个方向可能会有门,给定起点和终点,求可以到达终点的...
  • chy20142109
  • chy20142109
  • 2016-06-05 17:38
  • 202

Codeforces 676C Vasya and String (两点法)

Codeforces 676C Vasya and String (两点法)
  • Tc_To_Top
  • Tc_To_Top
  • 2016-05-26 14:30
  • 1062

Codeforces 676D - Theseus and labyrinth 【BFS(二进制优化迷宫旋转)】

Codeforces 676D - Theseus and labyrinth 【BFS(二进制优化迷宫旋转)】 Theseus has just arrived to Crete to fight...
  • my_sunshine26
  • my_sunshine26
  • 2017-07-30 18:12
  • 105
    个人资料
    • 访问:155919次
    • 积分:8295
    • 等级:
    • 排名:第2812名
    • 原创:704篇
    • 转载:2篇
    • 译文:0篇
    • 评论:19条
    最新评论