Main/C++/2018/S1.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int N, V;
    cin >> N;

    vector<int> road;

    for (int i = 0; i < N; i++)
    {
        cin >> V;
        road.push_back(V);
    }

    sort(road.begin(), road.end());

    float min_size = -1, current_size, left, right;
    for (int i = 1; i < N-1; i++)
    {
        left = (road[i] - road[i-1])/2.0;
        right = (road[i+1] - road[i])/2.0;
        current_size = left + right;
        if (min_size == -1 || current_size < min_size)
            min_size = current_size;
    }
   std::cout << std::fixed << std::setprecision(1) << min_size;

    return 0;
}