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;
    }
  • 相关阅读:
    P1119 灾后重建
    P1453 城市环路
    21.10.28模拟 C
    21.10.28模拟 String Coloring AGC26 C
    P1155 [NOIP2008 提高组] 双栈排序
    21.10.27模拟 solve
    21.10.27模拟 P4157 [SCOI2006]整数划分
    P2168 [NOI2015] 荷马史诗
    P3052 [USACO12MAR]Cows in a Skyscraper G
    P2533 [AHOI2012]信号塔 P1742 最小圆覆盖
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4172193.html
Copyright © 2011-2022 走看看