zoukankan      html  css  js  c++  java
  • Codeforces Round #354 (Div. 2)-A

    A. Nicholas and Permutation
    题目链接:http://codeforces.com/contest/676/problem/A

    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次[一次交换任意的2个数的位置],问最大值和最小值的距离最大是多少?

    思路:因为只能交换一次。所以肯定把某一个[最大值/最小值]反正最边是最优的。

    #include<iostream>
    #include<algorithm>
    #include<cstdio>
    #include<string>
    #include<cstring>
    #include<cmath>
    #include<bitset>
    using namespace std;
    #define INF 0x3f3f3f3f
    #define PI 3.14159
    const int MAXN=100+5;
    int num[MAXN];
    int main()
    {
    #ifdef kirito
        freopen("in.txt","r",stdin);
        freopen("out.txt","w",stdout);
    #endif
        int n;
        while(~scanf("%d",&n)){
            int MAX_pos,MIN_pos;
            for(int i=1;i<=n;i++)
            {
                scanf("%d",&num[i]);
                if(num[i]==1){MIN_pos=i;}
                if(num[i]==n){MAX_pos=i;}
            }
            printf("%d
    ",max(n-min(MAX_pos,MIN_pos),max(MAX_pos,MIN_pos)-1));
    
        }
        return 0;
    }
  • 相关阅读:
    PSFTP使用简单教程
    JavaMail应用--通过javamail API实现在代码中发送邮件功能
    java常用数据类型转换
    自己封装的Java excel数据读取方法
    java怎样实现重载一个方法
    怎样做好测试保证交付产品质量
    软件测试之测试用例颗粒度问题
    Python 一句命令启动一个web服务器
    ansible 模块之在学习--lineinfile
    centos 7 安装sql 审核工具 inception + archer
  • 原文地址:https://www.cnblogs.com/kirito520/p/5550331.html
Copyright © 2011-2022 走看看