Submission #4020507

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;

int main(){
  ios::sync_with_stdio(false);
  cin.tie(0);
  int x, y;
  cin >> n >> x >> y;
  int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  if (n == 1) {
    cout << abs(a[0] - y) << endl;
    return 0;
  }
  if (n == 2) {
    cout << max(abs(a[0]-a[1]), abs(a[1] - y));
    return 0;
  }
  sort(a+1,a+n-1);
  int ans = abs(a[n - 1] - a[1]);
  ans = max(ans, abs(max(a[0],a[n-2]) - a[n-1]));
  ans = max(ans, abs(a[n-1] - y));
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result