#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define X first #define Y second #define pb push_back #define rep(X,Y) for (int (X) = 0;(X) < (int)(Y);++(X)) #define reps(X,S,Y) for (int (X) = (int)(S);(X) < (int)(Y);++(X)) #define rrep(X,Y) for (int (X) = (int)(Y)-1;(X) >=0;--(X)) #define rreps(X,S,Y) for (int (X) = (int)(Y)-1;(X) >= (int)(S);--(X)) #define repe(X,Y) for ((X) = 0;(X) < (Y);++(X)) #define peat(X,Y) for (;(X) < (Y);++(X)) #define all(X) (X).begin(),(X).end() #define rall(X) (X).rbegin(),(X).rend() #define eb emplace_back #define UNIQUE(X) (X).erase(unique(all(X)),(X).end()) #define Endl endl #define NL <<"\n" #define cauto const auto using namespace std; using ll=long long; using pii=pair; using pll=pair; template using vv=vector>; template inline bool MX(T &l,const T &r){return l inline bool MN(T &l,const T &r){return l>r?l=r,1:0;} //#undef NUIP #ifdef NUIP #include "benri.h" #else #define out(args...) #endif void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<vector table(int n, T v){ return vector(n, v);} template auto table(int n, Args... args){auto val = table(args...); return vector(n, move(val));} #endif template pair operator+(const pair &p,const pair &q){ return {p.X+q.X,p.Y+q.Y};} template pair& operator+=(pair &p,const pair &q){ p.X+=q.X; p.Y+=q.Y; return p;} template pair operator-(const pair &p,const pair &q){ return {p.X-q.X,p.Y-q.Y};} template pair& operator-=(pair &p,const pair &q){ p.X-=q.X; p.Y-=q.Y; return p;} template istream& operator>>(istream &is, pair &p){ is>>p.X>>p.Y; return is;} template T read(){ T re; cin>>re; return move(re);} template T read(const T &dec){ T re; cin>>re; return re-dec;} template vector readV(const int sz){ vector re(sz); for(auto &x:re) x=read(); return move(re);} template vector readV(const int sz, const T &dec){ vector re(sz); for(auto &x:re) x=read(dec); return move(re);} vv readG(const int &n,const int &m){ vv g(n); rep(_,m){ cauto a=read(1),b=read(1); g[a].pb(b); g[b].pb(a);} return move(g);} vv readG(const int &n){ return readG(n,n-1);} #define TT cauto TTT=read();rep(_,TTT) const ll MOD=1e9+7; //998244353; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout<0 && t(all(vs)).size()>1); vector sum(n+1); rep(i,n) sum[i+1]=sum[i]+vs[i]; cauto get= [&](int l,int r,int i){ cauto R=clamp(i,l,r); ll re=0; re+=vs[i]*(R-l); re-=sum[R]-sum[l]; re+=sum[r]-sum[R]; re-=vs[i]*(r-R); return re; }; ll re=1e18; rep(posL,n+1-t){ cauto posR=posL+t; cauto dif=[&](int i){ return -min(i,posL)+max(0,min(i,posR)-posL)-max(0,i-posR);}; cauto eval= [&](int i){ return -get(0,posL,i)+get(posL,posR,i)-get(posR,n,i); }; if(t==0){ MN(re,eval(0)); MN(re,eval(n-1)); continue; } int l=posL,r=posR-1; // if(l) --l; // if(r==n) --r; while(r-l>4){ cauto m=(l+r)/2; out(m,eval(m+1),eval(m),dif(m+1),(vs[m+1]-vs[m])*(dif(m+1)-(t-(n-t)-dif(m+1))),1); assert(eval(m+1)-eval(m)==(vs[m+1]-vs[m])*(dif(m+1)-(t-(n-t)-dif(m+1)))); (eval(m+1)-eval(m)<0?l:r)=m; } reps(i,l,r+1) MN(re,eval(i)); // MN(re,eval(posL)); // MN(re,eval(max(0,posR-1))); } cout<