// #pragma once
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18 + 100;
const int maxn = 1e6 + 100;
const int maxl = 20;
int n, C;
ll a[maxn];
ll b[maxn];
ll p[2][maxl][maxn];
int lg[maxn];
ll ans[3030][3030];
// struct asd{
// ll ans;
// ll a, b;
// } d[maxn * 4];
// asd f(asd a, asd b){
// asd c;
// c.a = max(a.a, b.a);
// c.b = max(a.b, b.b);
// c.ans = max({a.ans, b.ans, a.a + b.b});
// return c;
// }
// void build(int v = 1, int tl = 1, int tr = n){
// if(tl == tr){
// d[v] = {0, b[tl] - a[tl], b[tl] + a[tl]};
// } else{
// int mid = (tl + tr) >> 1;
// build(v<<1, tl, mid);
// build(v<<1|1, mid+1, tr);
// d[v] = f(d[v<<1], d[v<<1|1]);
// }
// }
// asd ans(int l, int r, int v = 1, int tl = 1, int tr = n){
// if(tr < l || tl > r) return {0, -INF, -INF};
// if(l <= tl && tr <= r) return d[v];
// int mid = (tl + tr) >> 1;
// return f(ans(l, r, v<<1, tl, mid)
// , ans(l, r, v<<1|1, mid+1, tr));
// }
ll get(int l, int r, int c){
if(l > r) return -INF;
int k = lg[r - l + 1];
return max(p[c][k][l], p[c][k][r-(1<<k)+1]);
}
ll f(int i, int j){
if(i > j) return f(j, i);
return a[j] - a[i];
}
long long find_shortcut(int N, std::vector <int> l, std::vector <int> d, int c){
n = N; C = c;
for(int i = 1; i <= n; i++){
b[i] = d[i-1];
if(i == 1) continue;
a[i] = a[i-1] + l[i - 2];
}
for(int i = 1; i <= n; i++){
p[0][0][i] = b[i] - a[i];
p[1][0][i] = b[i] + a[i];
if(i > 1) lg[i] = lg[i >> 1] + 1;
}
for(int c = 0; c < 2; c++){
for(int k = 1; k <= lg[n]; k++){
for(int i = 1; i + (1<<k) - 1 <= n; i++){
p[c][k][i] = max(p[c][k-1][i], p[c][k-1][i+(1<<(k-1))]);
}
}
}
ll res = INF;
for(int l = 1; l < n; l++){
for(int r = l + 1; r <= n; r++){
ll mx = 0;
for(int i = 1; i < n; i++){
for(int j = i + 1; j <= n; j++){
ll mn = min({f(i, j), f(i, l) + C + f(r, j),
f(i, r) + C + f(l, j)});
mx = max(mx, mn + b[i] + b[j]);
}
}
res = min(res, mx);
}
}
return res;
}
