#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include"shortcht.h"
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define N 110
ll r[N],d[N],n,cost;
ll solve(ll p,ll q){
ll x=-1e17;
for(int i=0;i<p;i++){
chmax(x,r[p]-r[i]+d[i]);
}
ll y=-1e17;
for(int i=q+1;i<n;i++){
chmax(y,r[i]-r[q]+d[i]);
}
ll ans=x+y+cost;
for(int i=p;i<=q;i++){
chmax(ans,x+min(r[i]-r[p],r[q]-r[i]+cost));
chmax(ans,y+min(r[i]-r[p]+cost,r[q]-r[i]));
}
vector<int> rs,ds;
for(int i=p;i<=q;i++){
rs.push_back(r[i]-r[p]);
ds.push_back(d[i]);
}
for(int i=p;i<=q;i++){
rs.push_back(r[i]-r[p]+cost+r[q]-r[p]);
ds.push_back(d[i]);
}
ll key=cost+r[q]-r[p];
int j=0;
deque<ll> Q; Q.push_front(-1);
for(int i=0;i<rs.size()/2;i++){
Q.pop_front();
for(;(rs[j+1]-rs[i])*2<=key;j++){
while(!Q.empty()&&Q.back()<=rs[i]+ds[i])Q.pop_back();
Q.push_back(rs[i]+ds[i]);
}
chmax(ans,Q.front()-rs[i]+ds[i]);
}
return ans;
}
ll find_shortcut(int nn,vector<int> l,vector<int> dd,int cc){
n=nn,cost=cc;
for(int i=0;i<n;i++)d[i]=dd[i];
r[0]=0;
for(int i=0;i<n-1;i++)r[i+1]=r[i]+l[i];
ll ans=1e17;
for(int p=0;p<n;p++)for(int q=p+1;q<n;q++){
chmin(ans,solve(p,q));
}
return ans;
}
Compilation message
shortcut.cpp:5:9: fatal error: shortcht.h: No such file or directory
#include"shortcht.h"
^~~~~~~~~~~~
compilation terminated.
