Submission #1798721

---

Source Code Expand

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>
#include<set>
 
using namespace std;
 
#define ALL(g) (g).begin(),(g).end()
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
#define p(p) cout<<(p)<<" ";
#define pb push_back
#define mp make_pair
#define INF 1<<25

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef long long ll;

//int dy[8]={1,1,1,0,0,-1,-1,-1};
//int dx[8]={-1,0,1,-1,1,-1,0,1};
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};

struct S{
	int a,b,c;
};
bool asc(const S& left,const S& right){
	return left.c > right.c;
}
#define int ll
int N,M,Z,W;
vector<ll> a,b,c,d;
vector<vector<ll>> dp;

void input(){
	cin>>N>>Z>>W;
	a.resize(N+1);
	rep(i,N)cin>>a[i];
	dp.resize(N+1,vector<ll>(2,-1));
}

int dfs(int now,int turn){
	if(dp[now][turn]!=-1)return dp[now][turn];
	int other;
	if(now!=0) other=a[now-1];
	else other = W;
	if(now==N-1)return abs(a[N-1]-other);
	int res;
	if(turn){
		int mx=abs(other-a[N-1]);
		REP(i,now,N-1){
			int tmp=dfs(i+1,0);
			mx=max(mx,tmp);
		}
		res=mx;
	}
	else{
		int mn=abs(other-a[N-1]);
		REP(i,now,N-1){
			int tmp=dfs(i+1,1);
			mn=min(mn,tmp);
		}
		res=mn;
	}
	return dp[now][turn]=res;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	input();
	P(dfs(0,1))
	return 0;
}

Submission Info

Judge Result