Prinova

#include <iostream>
#include <algorithm>
#define F first
#define S second

using namespace std;

int d[100];
pair<int, int> p;

int main(){

    int n, a, b;
    cin >> n;

    for(int i=0; i<n; i++) cin >> d[i];

    cin >> a >> b;

    sort(d, d+n);

    for(int i=1; i<n; i++){
        if(d[i]<a) continue;
        if(d[i-1]>b) continue;

        int dist = (d[i]-d[i-1])/2;

        if(d[i-1]+dist <= a){
            dist = a-d[i-1];
            if(!((d[i-1]+dist)&1)) dist++;
        }
        if(d[i-1]+dist >= b){
            dist = b-d[i-1];
            if(!((d[i-1]+dist)&1)) dist--;
        }
        if(!((d[i-1]+dist)&1)) dist++;

        int val = min(dist, d[i]-d[i-1]-dist);

        if(val > p.F) p = {val, d[i-1]+dist};
    }

    if(!(a&1)) a++;
    if(!(b&1)) b--;
    if(a<=d[0] && d[0]-a >= p.F) p = {d[0]-a, a};
    if(b>=d[n-1] && b-d[n-1] >= p.F) p = {b-d[n-1], b};

    cout << p.S;

    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED