Submission #5545668

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<complex>
using namespace std;
typedef long long ll;
ll n,z,w,a[2010];
int main(){
  cin>>n>>z>>w;
  for(int i=0;i<n;i++)cin>>a[i];
  if(n==1){
      cout<<abs(a[0]-w)<<endl;
  }
  else{
      ll vl=abs(a[n-2]-a[n-1]);
      ll vr=abs(a[n-1]-w);
      cout<<max(vl,vr)<<endl;
  }
  return 0;
}

Submission Info

Judge Result