Nicholas and Permutation
来源:互联网 发布:()知劲草,路遥知马力 编辑:程序博客网 时间:2024/05/22 10:23
Nicholas has an array a that containsndistinct integers from1 ton. 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.
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.
Print a single integer — the maximum possible distance between the minimum and the maximum elements Nicholas can achieve by performing exactly one swap.
54 5 1 3 2
3
71 6 5 3 4 7 2
6
66 5 4 3 2 1
5
In the first sample, one may obtain the optimal answer by swapping elements1 and2.
In the second sample, the minimum and the maximum elements will be located in the opposite ends of the array if we swap7 and2.
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 and2.
题意:
交换这个序列里面的两个数使最大的数和最小的数的距离最大,问这个最大的距离是多少;
思路:
把最大的和最小的分别和第一个和最后一个交换,最大的就是答案了;
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;}}}
- Nicholas and Permutation
- Nicholas and Permutation
- A. Nicholas and Permutation
- codeforces 676A Nicholas and Permutation
- CodeForces 676A Nicholas and Permutation
- 【CodeForces 676】A - Nicholas and Permutation
- codeforces 676A Nicholas and Permutation
- Codeforces Round #354 (Div. 2)767A. Nicholas and Permutation
- Codeforces Round #354 (Div. 2) A Nicholas and Permutation
- Codeforces Round #354 (Div. 2) A Nicholas and Permutation(水题)
- Codeforces Round #354 (Div. 2)-Nicholas and Permutation
- CodeForces - 676A Nicholas and Permutation (模拟) 水
- CodeForces 676A Nicholas and Permutation(移动数字游戏)
- 【Codeforces Round 354 (Div 2)A】【水题 贪心】Nicholas and Permutation 恰好交换一次的pos[n]-pos[1]
- B. Levko and Permutation
- Codeforces554D:Kyoya and Permutation
- hdoj4985Little Pony and Permutation
- [codeforces]Levko and Permutation
- 大华面试
- MyBatis学习4---使用MyBatis_Generator生成Dto、Dao、Mapping
- 解读膳食指南(3)-2016与2007版可视化对比
- unable to resolve target android 21
- 【algorithm】BFS实例一
- Nicholas and Permutation
- python __ini__.py
- linux定时任务crontab
- HDOJ/HDU 1328 IBM Minus One(水题一个,试试手)
- Saltstack-UI (halite) 安装
- Hibernate中,left join、inner join以及left
- Android显示Gif动图
- Spring配置文件浅析(学习笔记)
- 舵机常见问题原理分析及解决办法