#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define F first
#define S second
using namespace std;
vector<pair<long long, long long> >g[10000000];//desde hasta peso
//long long dist[501][501];
bool recorridos[10000000];
long long dp(long long pos, long long hasta){
if(pos==hasta)return 0;
recorridos[pos]=true;
long long ret=LLONG_MAX/3, tam=g[pos].size();
for(long long i = 0 ; i < tam ; i++){
if(!recorridos[g[pos][i].F])ret=min(ret, dp(g[pos][i].F, hasta)+g[pos][i].S);
}
recorridos[pos]=false;
return ret;
}
long long find_shortcut(int n, vector<int> l, vector<int> d, int c)
{ /*
for(long long i = 0 ; i < n ; i ++){
for(long long j = 0 ; j < n ; j++ ){
dist[i][j]=LLONG_MAX;
}
}*/
for(long long i = 0 ; i < n-1 ; i ++){
recorridos[i]=false;
g[i].PB(MP(i+1, l[i]));
g[i+1].PB(MP(i, l[i]));
//dist[i][i+1]=l[i];
//dist[i+1][i]=l[i];
}
recorridos[n-1]=false;
long long minimo=LLONG_MAX/3;
for(long long i = 0 ; i < n-1 ; i ++){
for(long long j = i+1 ; j < n ; j ++){
//if(dist[i][j]<=c)continue;
g[i].push_back(make_pair(j, c));
g[j].push_back(make_pair(i, c));
long long maximo=-1, resact;
for(long long x = 0 ; x < n-1 ; x ++){
for(long long y = x+1 ; y < n ; y++){
resact=dp(x, y);
//cout<<"de "<<x<<" a "<<y<<" con union en "<<i<<" y "<<j<<" da "<<resact<<endl;
maximo=max(maximo, d[x]+d[y]+resact);
}
}
g[i].pop_back();
g[j].pop_back();
minimo=min(maximo, minimo);
}
}
return minimo;
}
