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

2024-05-29 03:51:59

Nicholas and Permutation

time limit :

1 second

memory limit: 256 megabytes

题目连接：

http://www.codeforces.com/contest/676/problem/A

Description

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.

Sample Input

5
4 5 1 3 2

Sample Output

3

题意

给你一个n的排列，然后你可以改变一次这个排列的位置

你需要使得最小的数和最大的数距离最大，问你这个距离是多少

题解：

把最小的数扔到边上，或者把最大的数扔到边上

代码：

#include<bits/stdc++.h>
using namespace std;
int a[105];
int main()
{int n,pos1,pos2;scanf("%d",&n);for(int i=1;i<=n;i++){scanf("%d",&a[i]);if(a[i]==1) pos1=i;if(a[i]==n) pos2=i;}int dis1=max(n-pos1,pos1-1);int dis2=max(n-pos2,pos2-1);if(dis1>dis2) cout<<dis1;else cout<<dis2;return 0;
}

转载于:https://www.cnblogs.com/wangdongkai/p/5531792.html

Codeforces Round #354 (Div. 2) A. Nicholas and Permutation相关推荐

Codeforces Round #636 (Div. 3) F. Restore the Permutation by Sorted Segments 思维 + 暴力
传送门文章目录题意: 思路: 题意: n≤200n\le200n≤200 思路: 首先关注到rrr从[2,n][2,n][2,n]都出现一次,所以很明显最后一个位置只出现一次,但是这样倒着来不是很 ...
Codeforces Round #354 (Div. 2)-A
A. Nicholas and Permutation 题目链接:http://codeforces.com/contest/676/problem/A Nicholas has an array a ...
Codeforces Round #354 (Div. 2)
贪心 A Nicholas and Permutation #include <bits/stdc++.h>typedef long long ll; const int N = 1e5 ...
Codeforces Round #354 (Div. 2)-Theseus and labyrint
原文链接题中给的迷宫有四个状态,我把每个状态对应的图都生成.用宽搜求出从原点到每个状态的迷宫的每个格子的最小距离. #include <iostream> #include <cs ...
Codeforces Round #354 (Div. 2) D. Theseus and labyrinth（bfs）
题意:给出一个n*m的地图,英雄从(xt,yt)出发,要到达敌人所在地(xm,ym).地图每个格子有设定: ^>v<代表向箭头方向有门,其他方向没门: URDL代表某个方向没门,其他方向都 ...
Codeforces Round #776 (Div. 3)-D. Twist the Permutation
原题链接:https://codeforces.com/contest/1650/problem/D 解题思路: 仔细审题,会发现对第i个数字做的操作不会影响到后面的i+1-等数字.即可以反过来从最后 ...
【贪心】Codeforces Round #436 (Div. 2) D. Make a Permutation!
题意:给你一个长度为n的数组,每个元素都在1~n之间,要你改变最少的元素,使得它变成一个1~n的排列.在保证改动最少的基础上,要求字典序最小. 预处理cnt数组,cnt[i]代表i在原序列中出现的次数 ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...

最新文章

热门文章