#include "shortcut.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<vii> vvii;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef vector<vpll> vvpll;
#define ffor(i, a, b) for (ll i = (a); i < (ll)(b); i++)
#define fford(i, a, b) for (ll i = (a); i > (ll)(b); i--)
#define rep(i, n) ffor(i, 0, n)
#define forin(x, a) for (auto &x: a)
#define all(a) a.begin(), a.end()
long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c) {
vll cum = {0};
forin(x, l) {
cum.emplace_back(cum.back() + x);
}
vector<pair<ll, pii>> dists;
rep(i, n - 1) {
ffor(j, i + 1, n) {
dists.emplace_back(cum[j] - cum[i] + d[i] + d[j], make_pair(i, j));
}
}
sort(all(dists), greater<>());
ll res = dists[0].first;
rep(k, dists.size()) {
int i = dists[k].second.first, j = dists[k].second.second;
ll curr = 0;
forin(dist, dists) {
if (dist.first <= curr) {
break;
}
curr = max(curr, min(dist.first, abs(cum[i] - cum[dist.second.first]) + abs(cum[j] - cum[dist.second.second]) + c + d[dist.second.first] + d[dist.second.second]));
if (curr >= res) {
break;
}
}
res = min(res, curr);
}
return res;
}
