#include #define int long long #define all(v)v.begin(),v.end() #define rall(v)v.rbegin(),v.rend() bool st; using namespace std; templateistream&operator>>(istream&I,vector&v){for(auto&i:v)I>>i;return I;} templateostream&operator<<(ostream&O,vector v){for(auto i:v)O<-1)return res; if(pos==n-1||t==T-1)return res=0; double x=0,y=numeric_limits::max(); for(int i=1;i<=m;++i){ int npos=pos+i; if(npos>=n)npos=2*(n-1)-npos; x+=P*(c[npos]+f(t+1,npos,mag)); if(!mag)y=min(y,c[npos]+f(t+1,npos,1)); } return res=min(x,y); } void solve(){ cin>>n>>m; for(int i=1;i<=n-2;++i)cin>>c[i]; for(int i=0;i>t; while(t--)AC::solve(); chrono::steady_clock::time_point ED=chrono::steady_clock::now(); cerr<(ED-St).count()<<" \tms\n"<<"Real Time : "<(ED-ST).count()<<" \tms\n"<<" : "<(ED-ST).count()<<" \t?s\n\n"<<"Total Memory : "<