#include "shortcut.h"
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll,ll>pairll;
#define N 100007
#define INF 1000000000007
#define fr first
#define sc second
ll a[10*N],b[10*N],a1[10*N],b1[10*N],t[10*N],ma[10*N],mb[10*N],h[3007][3007],x[3007][3007],y[3007][3007];
priority_queue<pairll>q,q1;
long long find_shortcut(int n, std::vector<int> k, std::vector<int> d, int c)
{
for(int i=1;i<n;i++){
a[i]=k[i-1];
b[i]=d[i-1];
t[i]=t[i-1]+a[i-1];
ma[i]=max(ma[i-1],a1[i-1]+a[i-1]+b[i]);
a1[i]=max(a1[i-1]+a[i-1],b[i]);
}
b[n]=d[n-1];
t[n]=t[n-1]+a[n-1];
ma[n]=max(ma[n-1],a1[n-1]+a[n-1]+b[n]);
a1[n]=max(a1[n-1]+a[n-1],b[n]);
for(int i=n;i>=1;i--){
mb[i]=max(mb[i+1],b1[i+1]+a[i]+b[i]);
b1[i]=max(b[i],b1[i+1]+a[i]);
}
for(int i=1;i<=n;i++){
for(int j=i;j<=n;j++){
h[i][i]=max(h[i][j],b[i]);
for(int k1=i;k1<=j;k1++){
x[i][j]=max(x[i][j],min(t[k1]-t[i]+b[k1],t[j]-t[k1]+b[k1]+c));
y[i][j]=max(y[i][j],min(t[k1]-t[i]+b[k1]+c,t[j]-t[k1]+b[k1]));
for(int k2=j;k2>k1;k2--){
if(t[k2]-t[k1]>t[j]-t[i]-(t[k2]-t[k1])+c){
h[i][j]=max(h[i][j],t[j]-t[i]-(t[k2]-t[k1])+c+b[k1]+b[k2]);
}else{
h[i][j]=max(h[i][j],t[k2]-t[k1]+b[k1]+b[k2]);
}
//cout<<k1<<" "<<k2<<" "<<i<<" "<<j<<" "<<t[k2]-t[k1]+b[k1]+b[k2]<<" "<<t[j]-t[k2]+(t[k1]-t[i])+c+b[k1]+b[k2]<<endl;
}
}
//cout<<h[i][j]<<" "<<i<<" "<<j<<endl;
}
}
b[n]=d[n-1];
//ll prew=INF;
ll res=ma[n];
// cout<<res<<endl;
for(int l=1;l<=n;l++){
for(int r=l+1;r<=n;r++){
res=min(res,max(max(ma[l],mb[r]),max(max(h[l][r],max(a1[l-1]+a[l-1]+x[l][r],b1[r+1]+a[r]+y[l][r])),min(ll(c),t[r]-t[l])+a1[l]+b1[r])));
//cout<<l<<" "<<r<<" "<<res<<" "<<a1[l-1]+a[l-1]<<" "<<mx2<<" "<<q1.top().fr+t[r]<<endl;
}
}
return res;
}
