zoukankan      html  css  js  c++  java
  • Codeforces Round #283 (Div. 2) A. Minimum Difficulty 暴力水题

    A. Minimum Difficulty
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Mike is trying rock climbing but he is awful at it.

    There are n holds on the wall, i-th hold is at height ai off the ground. Besides, let the sequence ai increase, that is, ai < ai + 1 for all i from 1 to n - 1; we will call such sequence a track. Mike thinks that the track a1, ..., an has difficulty . In other words, difficulty equals the maximum distance between two holds that are adjacent in height.

    Today Mike decided to cover the track with holds hanging on heights a1, ..., an. To make the problem harder, Mike decided to remove one hold, that is, remove one element of the sequence (for example, if we take the sequence (1, 2, 3, 4, 5) and remove the third element from it, we obtain the sequence (1, 2, 4, 5)). However, as Mike is awful at climbing, he wants the final difficulty (i.e. the maximum difference of heights between adjacent holds after removing the hold) to be as small as possible among all possible options of removing a hold. The first and last holds must stay at their positions.

    Help Mike determine the minimum difficulty of the track after removing one hold.

    Input

    The first line contains a single integer n (3 ≤ n ≤ 100) — the number of holds.

    The next line contains n space-separated integers ai (1 ≤ ai ≤ 1000), where ai is the height where the hold number i hangs. The sequence ai is increasing (i.e. each element except for the first one is strictly larger than the previous one).

    Output

    Print a single number — the minimum difficulty of the track after removing a single hold.

    Sample test(s)
    Input
    3
    1 4 6
    Output
    5
    Input
    5
    1 2 3 4 5
    Output
    2
    Input
    5
    1 2 3 7 8
    Output
    4
    Note

    In the first sample you can remove only the second hold, then the sequence looks like (1, 6), the maximum difference of the neighboring elements equals 5.

    In the second test after removing every hold the difficulty equals 2.

    In the third test you can obtain sequences (1, 3, 7, 8), (1, 2, 7, 8), (1, 2, 3, 8), for which the difficulty is 4, 5 and 5, respectively. Thus, after removing the second element we obtain the optimal answer — 4.

    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <ctime>
    #include <iostream>
    #include <algorithm>
    #include <set>
    #include <vector>
    #include <sstream>
    #include <queue>
    #include <typeinfo>
    #include <fstream>
    typedef long long ll;
    using namespace std;
    //freopen("D.in","r",stdin);
    //freopen("D.out","w",stdout);
    #define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
    #define maxn 1001
    const int inf=0x7fffffff;   //无限大
    int h[maxn];
    int main()
    {
        int n;
        cin>>n;
        cin>>h[0];
        int minn=0;
        for(int i=1;i<n-1;i++)
        {
            cin>>h[i];
            minn=max(h[i]-h[i-1],minn);
        }
        cin>>h[n-1];
        minn=max(h[n-1]-h[n-2],minn);
        //cout<<minn<<endl;
        int kiss=10000;
        for(int i=2;i<n;i++)
        {
            kiss=min(h[i]-h[i-2],kiss);
        }
        //cout<<kiss<<endl;
        cout<<max(kiss,minn)<<endl;
        return 0;
    }
  • 相关阅读:
    Mac 上 Go 语言的安装以及编辑器的配置
    【Go学习】立Flag
    python 使用多线程同时执行多个函数
    python闭包
    mfs环境搭建之元数据服务器(master)节点安装-2
    mfs分布式文件系统介绍-01
    vscode中vim插件对ctrl键的设置
    文本截取{}的内容,生成新数组
    如何过滤a数组中b数组存在的值
    js动态加载js文件
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4172193.html
Copyright © 2011-2022 走看看