Submission #2690120

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>
#include <math.h>
#include <set>
#include <map>
#include <string>
#include <stack>
#include <queue>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <bitset>
#define _USE_MATH_DEFINES
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> plglg;
typedef tuple<int, int, int> tiii;
typedef tuple<ll, ll, ll> tlglglg;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
double pi = 3.141592653589793;
ll mod = 1000000007;
int intmax = 2147483647;
int intmin = -2147483648;
ll llmax = 9223372036854775807;
ll llmin = -9223372036854775807;
ll inf = llmax / 2;

int main() {
    int N, Z, W;
    cin >> N >> Z >> W;
    int a[N];
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }
    int diffa = abs(a[N - 1] - W);
    int diffb = (N > 1) ? abs(a[N - 2] - a[N - 1]) : 0;
    cout << max(diffa, diffb) << endl;
}

Submission Info

Judge Result