#include <bits/stdc++.h>
#define pb push_back
using namespace std;
#include "shortcut.h"
long long inf = 1e16;
long long find_shortcut(int n, vector<int> l, vector<int> d, int c){
vector<long long> pre(n);
for(int i = 0; i < n-1; i++){
pre[i+1] = pre[i] + l[i];
}
vector<long long> lfar(n), rfar(n);
lfar[0] = d[0];
for(int i = 1; i < n; i++){
if(d[i] > lfar[i-1] + l[i-1]) lfar[i] = d[i];
else lfar[i] = lfar[i-1] + l[i-1];
}
rfar[n-1] = d[n-1];
for(int i = n-2; i >= 0; i--){
if(d[i] > rfar[i+1] + l[i]) rfar[i] = d[i];
else rfar[i] = rfar[i+1] + l[i];
}
long long ans = inf;
bool calc = false;
for(int l = 0; l < n; l++){
for(int r = l+1; r < n; r++){
if(pre[r] - pre[l] < c && calc) continue;
calc = true;
long long dis = lfar[l] + rfar[r] + min((long long)c, pre[r] - pre[l]); // L-R
long long clen = pre[r] - pre[l] + c;
for(int j = l+1; j <= r; j++){
dis = max(dis, lfar[l] + (long long)d[j] + min(pre[j] - pre[l], clen - (pre[j] - pre[l])));
} // L-M
for(int j = l; j < r; j++){
dis = max(dis, rfar[r] + (long long)d[j] + min(pre[r] - pre[j], clen - (pre[r] - pre[j])));
} // R-M
for(int j = l+1; j < r; j++){ // M-M
long long addj = d[j];
for(int j2 = j+1; j2 < r; j2++){
long long addj2 = d[j2];
dis = max(dis, min(pre[j2] - pre[j], clen - (pre[j2] - pre[j])) + addj + addj2);
}
}
for(int j = 0; j < l; j++){
for(int j2 = j+1; j2 <= l; j2++){
dis = max(dis, pre[j2] - pre[j] + (long long)d[j] + (long long)d[j2]);
}
} // L-L
for(int j = r; j < n; j++){
for(int j2 = j+1; j2 < n; j2++){
dis = max(dis, pre[j2] - pre[j] + (long long)d[j] + (long long)d[j2]);
}
} // R-R
ans = min(ans, dis);
}
}
return ans;
}
