A. Nicholas and Permutation
来源:互联网 发布:e63诺基亚软件下载网址 编辑:程序博客网 时间:2024/06/18 15:29
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.
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.
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 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的距离最远,由于只有一次交换机会,肯定是把1或者把n移到数列的一端,考虑各种情况进行比较即可。
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cmath>int main(){int n,arr[101],i,poss,posl,max;scanf("%d",&n);for(i=0;i<n;i++){scanf("%d",&arr[i]);if(arr[i]==1){poss=i;}if(arr[i]==n){posl=i;}}if(n-1-poss>n-1-posl){max=n-1-poss;}else{max=n-1-posl;}if(max<poss){max=poss;}if(max<posl){max=posl;}printf("%d\n",max);return 0;}
- 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
- Nicholas and Permutation
- 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 - 676A Nicholas and Permutation (模拟) 水
- CodeForces 676A Nicholas and Permutation(移动数字游戏)
- 【Codeforces Round 354 (Div 2)A】【水题 贪心】Nicholas and Permutation 恰好交换一次的pos[n]-pos[1]
- Codeforces Round #354 (Div. 2)-Nicholas and Permutation
- 【codechef】Chef and A Large Permutation(技巧题)
- HDU 4985/BC 7A Little Pony and Permutation
- B. Levko and Permutation
- Codeforces554D:Kyoya and Permutation
- 阿里云Hadoop开发自动打包上传运行maven的pom.xml
- Servlet&JSP (一)基础
- 使用ZooKeeper实现Java跨JVM的分布式锁(读写锁)
- 基于spark实现的CRF模型的使用与源码分析
- hdu2044 一只小蜜蜂....
- A. Nicholas and Permutation
- NDIS Filter Study
- 地图寻宝
- ViewInject原理
- 死锁的产生以及如何防止死锁的产生
- trickyPriorityQueue
- python 装饰器传参
- [leetcode] 【链表】 146. LRU Cache
- leetcode Clone Graph