Submission #2703369

---

Source Code Expand

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

typedef long long ll;
typedef pair <int, int> ii;
typedef pair <int, ii> iii;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
#ifdef VC
#define scanf scanf_s
#endif
#define iINF (1<<30)
#define INF (1LL<<59)
#define forn(i) for(int i = 0;i < n; ++i)
#define form(i,n) for(int i = 0 ;i < n; ++i)
#define NIL -1

const ll mod = 998244353;
int n;

int main() {
	int z, w;
	int a[2010];
	cin >> n >> z >> w;
	forn(i)cin >> a[i];
	int ans;
	ans = abs(w - a[n - 1]);
	if (n > 1) {
		ans = max(ans, abs(a[n - 1] - a[n - 2]));
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result