Submission #1799980

---

Source Code Expand

#include <iostream>
#include <cstring>
using namespace std;
int n, mx, mn, a[1005], d[1005][1005];
int abs(int p) {return p>0?p:-p;}

int f(int p, int q) {
	int i;
	if(p==n+1 || q==n+1)
		return d[p][q] = abs(a[p]-a[q]);
	if(d[p][q]!=-1) return d[p][q];
	if(p<q) {
		mx = -1;
		for(i=q+1; i<n+2; i++) mx = max(mx, f(i, q));
		d[i][q] = mx;
	} else {
		mn = 2e9;
		for(i=p+1; i<n+2; i++) mn = min(mn, f(p, i));
		d[p][i] = mn;
	}
}

int main() {
	cin>>n>>a[0]>>a[1];
	for(int i=2; i<n+2; i++) cin>>a[i];
	memset(d, -1, sizeof(d));
	cout<<f(0, 1);
	return 0;
}

Submission Info

Judge Result