#include<algorithm>
#include<cstring>
#include<cstdio>
#define Re register int
using namespace std;
const int N=103,M=4e4+3;
int n,m,x,y,z,V,ans,v[N*17],w[N*17],dp[M];
inline void in(Re &x){
Re fu=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')fu|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=fu?-x:x;
}
int main(){
in(m),in(V);
memset(dp,-127,sizeof(dp));
dp[0]=0;
while(m--){
in(x),in(y),in(z);Re p=1;
while(z>=p)v[++n]=y*p,w[n]=x*p,z-=p,p<<=1;
if(z)v[++n]=y*z,w[n]=x*z;
}
for(Re i=1;i<=n;++i)
for(Re j=V;j>=v[i];--j)
dp[j]=max(dp[j],dp[j-v[i]]+w[i]);
for(Re i=0;i<=V;++i)ans=max(ans,dp[i]);
printf("%d\n",ans);
}
#include<cstdio>
#define Re register int
const int N=7003,M=7003;
int n,h,t,V,mp,tmp,v[N],w[N],c[N],Q[N],K[N],dp[M];
inline void in(Re &x){
Re fu=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')fu|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=fu?-x:x;
}
inline int max(Re a,Re b){return a>b?a:b;}
inline int min(Re a,Re b){return a<b?a:b;}
int main(){
in(n),in(V);
for(Re i=1;i<=n;++i)in(v[i]),in(w[i]),in(c[i]);
for(Re i=1;i<=n;++i)
for(Re r=0;r<v[i];++r){
h=1,t=0,mp=(V-r)/v[i];
for(Re p=0;p<=mp;++p){
tmp=dp[p*v[i]+r]-w[i]*p;
while(h<=t&&Q[t]<=tmp)--t;
Q[++t]=tmp,K[t]=p;
while(h<=t&&p-K[h]>min(c[i],V/v[i]))++h;
dp[p*v[i]+r]=max(dp[p*v[i]+r],Q[h]+p*w[i]);
}
}
printf("%d",dp[V]);
}
// luogu-judger-enable-o2
#include<bits/stdc++.h>
using namespace std;
int pan[100010],b[100010],f[100010],n,i,a,len=1,l,r,mid;
inline int in(){
int x=0,fh=1;char c=getchar();
while(c<'0'||c>'9')c=getchar();
while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
return x*fh;
}
int main(){
n=in();
for(i=1;i<=n;i++)a=in(),pan[a]=i,f[i]=0xfffffff;
for(i=1;i<=n;i++)a=in(),b[i]=pan[a];
for(i=1;i<=n;i++)printf("%d ",b[i]);puts("");
f[1]=b[1];
for(i=2;i<=n;i++){
l=0;r=len;
if(b[i]>f[len])f[++len]=b[i];
else{
while(l<r){
mid=(l+r)/2;
if(f[mid]<b[i])l=mid+1;
else r=mid;
}
f[l]=min(b[i],f[l]);
}
}
for(i=1;i<=n;i++)printf("%d ",f[i]);puts("");
printf("%d",len);
return 0;
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<vector>
#define LL long long
#define Re register int
using namespace std;
const LL N=2e4+3,inf=1e18;
int n,K,L[N],R[N],D[N],C[N],W[N],S[N];LL ans=inf,dp[N];vector<int>V[N];
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
inline LL calc(Re j,Re i){
LL ans=0;
for(Re k=j+1;k<i;++k)if(L[k]>j&&R[k]<i)ans+=W[k];
return ans;
}
struct Segment_Tree{
#define pl (p<<1)
#define pr (p<<1|1)
#define mid ((L+R)>>1)
LL tr[N<<2],add[N<<2];
inline void updata(Re p,LL v){tr[p]+=v,add[p]+=v;}
inline void pushdown(Re p){
if(add[p])updata(pl,add[p]),updata(pr,add[p]),add[p]=0;
}
inline void build(Re p,Re L,Re R){
add[p]=0;
if(L==R){tr[p]=dp[L];return;}
build(pl,L,mid),build(pr,mid+1,R);
tr[p]=min(tr[pl],tr[pr]);
}
inline void change(Re p,Re L,Re R,Re l,Re r,Re v){
if(l<=L&&R<=r){updata(p,v);return;}
pushdown(p);
if(l<=mid)change(pl,L,mid,l,r,v);
if(r>mid)change(pr,mid+1,R,l,r,v);
tr[p]=min(tr[pl],tr[pr]);
}
inline void change(Re p,Re L,Re R,Re x,Re v){
if(L==R){tr[p]+=v;return;}
pushdown(p);
if(x<=mid)change(pl,L,mid,x,v);
else change(pr,mid+1,R,x,v);
tr[p]=min(tr[pl],tr[pr]);
}
inline LL ask(Re p,Re L,Re R,Re l,Re r){
if(l<=L&&R<=r)return tr[p];
LL ans=inf;pushdown(p);
if(l<=mid)ans=min(ans,ask(pl,L,mid,l,r));
if(r>mid)ans=min(ans,ask(pr,mid+1,R,l,r));
return ans;
}
#undef mid
}TR;
int main(){
// freopen("123.txt","r",stdin);
in(n),in(K);
for(Re i=2;i<=n;++i)in(D[i]);
for(Re i=1;i<=n;++i)in(C[i]);
for(Re i=1;i<=n;++i){
in(S[i]);
Re l=1,r=i;
while(l<r){
Re mid=l+r>>1;
if(D[mid]>=D[i]-S[i])r=mid;
else l=mid+1;
}
L[i]=r;
l=i,r=n;
while(l<r){
Re mid=l+r+1>>1;
if(D[mid]<=D[i]+S[i])l=mid;
else r=mid-1;
}
R[i]=l,V[R[i]].push_back(i);
}
for(Re i=1;i<=n;++i)in(W[i]);
memset(dp,20,sizeof(dp));
dp[0]=0,D[0]=-1e9,C[n+1]=0;
for(Re k=1;k<=K;++k){
TR.build(1,0,n);
for(Re i=1;i<=n+1;++i){
LL tmp=dp[i];
dp[i]=min(dp[i],TR.ask(1,0,n,0,i-1)+C[i]);
for(Re j=0,SZ=V[i].size();j<SZ;++j)TR.change(1,0,n,0,L[V[i][j]]-1,W[V[i][j]]);
if(dp[i]!=tmp)TR.change(1,0,n,i,dp[i]-tmp);
}
ans=min(ans,dp[n+1]);
}
printf("%lld\n",ans);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register int
using namespace std;
const int N=1e5+3,M=23;
int n,K,A[N];LL dp[M][N];
inline void in(Re &x){
int f=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
struct MODUI{
int nowL,nowR,cnt[N];LL ans;
inline LL calc(Re L,Re R){
while(nowR<R)++nowR,ans+=cnt[A[nowR]]++;
while(nowL>L)--nowL,ans+=cnt[A[nowL]]++;
while(nowR>R)ans-=--cnt[A[nowR]],--nowR;
while(nowL<L)ans-=--cnt[A[nowL]],++nowL;
return ans;
}
}TR;
inline void sakura(Re l,Re r,Re L,Re R,Re k){
if(l>r)return;Re mid=l+r>>1,w=0;LL tmp;
for(Re j=L;j<=R&&j<mid;++j)
if((tmp=dp[k-1][j]+TR.calc(j+1,mid))<=dp[k][mid])
dp[k][mid]=tmp,w=j;
sakura(l,mid-1,L,w,k),sakura(mid+1,r,w,R,k);
}
int main(){
// freopen("123.txt","r",stdin);
in(n),in(K);
for(Re i=1;i<=n;++i)in(A[i]);
memset(dp,19,sizeof(dp)),dp[0][0]=0;
TR.nowL=1,TR.nowR=0;
for(Re k=1;k<=K;++k)sakura(k,n,k-1,n-1,k);
printf("%lld\n",dp[K][n]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register int
using namespace std;
const int N=25003,M=27;
int n,K,A[N];LL dp[M][N];
inline void in(Re &x){
int f=0;x=0;char ch=getchar();
while(ch<'0'||ch>'9')f|=ch=='-',ch=getchar();
while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;
}
struct BIT{
int nowL,nowR,C[N];LL ans;
inline void add(Re x,Re v){if(!x)return;while(x<=n)C[x]+=v,x+=x&-x;}
inline int ask(Re x){Re ans=0;while(x)ans+=C[x],x-=x&-x;return ans;}
inline LL calc(Re L,Re R){
while(nowR<R)++nowR,ans+=ask(A[nowR]-1),add(A[nowR],1);
while(nowL>L)--nowL,ans+=nowR-nowL-ask(A[nowL]),add(A[nowL],1);
while(nowR>R)add(A[nowR],-1),ans-=ask(A[nowR]-1),--nowR;
while(nowL<L)add(A[nowL],-1),ans-=nowR-nowL-ask(A[nowL]),++nowL;
return ans;
}
}TR;
inline void sakura(Re l,Re r,Re L,Re R,Re k){
if(l>r)return;Re mid=l+r>>1,w=0;LL tmp;
for(Re j=L;j<=R&&j<mid;++j)
if((tmp=dp[k-1][j]+TR.calc(j+1,mid))<=dp[k][mid])
dp[k][mid]=tmp,w=j;
sakura(l,mid-1,L,w,k),sakura(mid+1,r,w,R,k);
}
int main(){
// freopen("123.txt","r",stdin);
in(n),in(K);
for(Re i=1;i<=n;++i)in(A[i]);
memset(dp,19,sizeof(dp)),dp[0][0]=0;
TR.nowL=1,TR.nowR=0;
for(Re k=1;k<=K;++k)sakura(k,n,k-1,n-1,k);
printf("%lld\n",dp[K][n]);
}
#include<algorithm>
#include<cstdio>
#include<cmath>
#define Re register int
using namespace std;
const int N=5e5+3;
int i,j,n,h,t,a[N],Q[N],Poi[N];
double p[N],sqr[N];
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
inline double Y(Re i,Re j){return a[j]+sqr[i-j];}
inline int find_Poi(int j1,int j2){// 找到两条直线的交点i
Re l=j2,r=n,mid,ans=n+1;// 为了防止两条直线没有交点,预设一个最大边界值
while(l<=r){
mid=l+r>>1;
if(Y(mid,j1)<=Y(mid,j2))ans=mid,r=mid-1;
// 当前位置i使用直线j1的值小于直线j2的值,说明交点i在当前位置右侧,因此右边界要缩小
else l=mid+1;
}
return ans;
}
inline void sakura(){
h=1,t=0;
for(i=1;i<=n;++i){
while(h<t&&Poi[t-1]>=find_Poi(Q[t],i))--t;
Poi[t]=find_Poi(Q[t],i),Q[++t]=i;
while(h<t&&Poi[h]<=i)++h;
// 找到位置j使得直线Q[j]与直线Q[j+1]的交点大于i
// 那么直线Q[j]是在i之前的最优直线,记录答案,自己画图模拟一下就懂了
p[i]=max(p[i],Y(i,Q[h]));
}
}
int main(){
in(n);
for(Re i=1;i<=n;++i)in(a[i]),sqr[i]=sqrt(i);
sakura();
for(Re i=1;i<n-i+1;++i)swap(a[i],a[n-i+1]),swap(p[i],p[n-i+1]);
sakura();
for(Re i=n;i;--i)printf("%d\n",(int)ceil(p[i])-a[i]);
}
#include<algorithm>
#include<cstdio>
#include<cmath>
#define Re register int
using namespace std;
const int N=5e5+3;
int i,j,n,h,t,a[N],Q[N],Poi[N];
double tmp,p[N],sqr[N];
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
inline void sakura(Re l,Re r,Re L,Re R){
if(l>r)return;
Re mid=l+r>>1,j0;double mx=0;
for(Re j=L;j<=mid&&j<=R;++j)
if((tmp=a[j]+sqr[mid-j])>mx)mx=tmp,j0=j;
p[mid]=max(p[mid],mx);
sakura(l,mid-1,L,j0),sakura(mid+1,r,j0,R);
}
int main(){
in(n);
for(Re i=1;i<=n;++i)in(a[i]),sqr[i]=sqrt(i);
sakura(1,n,1,n);
for(Re i=1;i<n-i+1;++i)swap(a[i],a[n-i+1]),swap(p[i],p[n-i+1]);
sakura(1,n,1,n);
for(Re i=n;i;--i)printf("%d\n",(int)ceil(p[i])-a[i]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=1e5+5;
LL p,n,m,P,w,h,t,H[N],T[N],Q[N],S[N],dp[105][N];
inline LL min(Re a,Re b){return a<b?a:b;}
// i
// k=j+1
//dp[p][i]=dp[p-1][j]+(i-j)*T[i]-(S[i]-S[j])
//(T[i]) * j + (dp[p][i]-i*T[i]+S[i]) = (dp[p-1][j]+S[j])
// k * x + b = y
inline LL X(Re j){return j;}
inline LL Y(Re j){return dp[p-1][j]+S[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
memset(dp,0x3f,sizeof(dp));dp[0][0]=0;
scanf("%lld%lld%lld",&n,&m,&P);
for(Re i=2;i<=n;H[i]+=H[i-1],++i)scanf("%lld",&H[i]);
for(Re i=1;i<=m;T[i]=t-H[w],++i)scanf("%lld%lld",&w,&t);
std::sort(T+1,T+m+1);
for(Re i=1;i<=m;++i)S[i]=S[i-1]+T[i];
for(p=1;p<=P;++p){
h=1,t=0,Q[++t]=0,dp[p][0]=0;
for(Re i=1;i<=m;++i){
while(h<t&&slope(Q[h],Q[h+1])<=T[i])++h;
dp[p][i]=min(dp[p-1][i],dp[p-1][j=Q[h]]+(i-j)*T[i]-S[i]+S[j]);
if(Y(i)>=0x3f3f3f3f3f3f3f3fll)continue;
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i))--t;
Q[++t]=i;
}
}
printf("%lld",dp[P][m]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LD long double
#define LL long long
#define Re register int
#define S2(a) (1ll*(a)*(a))
using namespace std;
const LL N=1e5+3,inf=1e18;
int n,H[N],W[N],Q[N];LL S[N],dp[N];
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
//dp[i]=min(dp[i],dp[j]+(H[i]-H[j])*(H[i]-H[j])+S[i-1]-S[j]);
//dp[i]=dp[j]-2*H[i]*H[j]+H[j]*H[j]+H[i]*H[i]+S[i-1]-S[j]
//(2*H[i]) * H[j] + (dp[i]-S[i-1]-H[i]*H[i]) = (dp[j]+H[j]*H[j]-S[j])
// k * x + b = y
#define X(j) (a[j].x)
#define Y(j) (a[j].y)
struct QAQ{
int k,x,id;LL y;
inline bool operator<(const QAQ &O)const{return x!=O.x?x<O.x:y<O.y;}
}a[N],b[N];
inline bool cmp(QAQ A,QAQ B){return A.k<B.k;}
inline LD slope(Re i,Re j){return X(i)==X(j)?(Y(j)>Y(i)?inf:-inf):(LD)(Y(j)-Y(i))/(X(j)-X(i));}
inline void CDQ(Re L,Re R){
if(L==R){Re j=a[L].id;a[L].y=dp[j]+(LL)H[j]*H[j]-S[j];return;}
Re mid=L+R>>1,p1=L,p2=mid+1,h=1,t=0;
for(Re i=L;i<=R;++i)a[i].id<=mid?b[p1++]=a[i]:b[p2++]=a[i];
for(Re i=L;i<=R;++i)a[i]=b[i];
CDQ(L,mid);
for(Re i=L;i<=mid;++i){
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i))--t;
Q[++t]=i;
}
for(Re i=mid+1,j,id;i<=R;++i){
while(h<t&&slope(Q[h],Q[h+1])<=a[i].k)++h;
if(h<=t)id=a[i].id,j=Q[h],dp[id]=min(dp[id],a[j].y-(LL)a[i].k*a[j].x+S[id-1]+(LL)H[id]*H[id]);
}
CDQ(mid+1,R);
Re w=L-1;p1=L,p2=mid+1;
while(p1<=mid&&p2<=R)b[++w]=a[p1]<a[p2]?a[p1++]:a[p2++];
while(p1<=mid)b[++w]=a[p1++];while(p2<=R)b[++w]=a[p2++];
for(Re i=L;i<=R;++i)a[i]=b[i];
}
int main(){
// freopen("123.txt","r",stdin);
in(n);
for(Re i=1;i<=n;++i)in(H[i]);
for(Re i=1;i<=n;++i)in(W[i]);
for(Re i=1;i<=n;++i)S[i]=S[i-1]+W[i],dp[i]=inf;
for(Re i=1;i<=n;++i)a[i].k=(H[i]<<1),a[i].x=H[i],a[i].id=i;
sort(a+1,a+n+1,cmp);
dp[1]=0,CDQ(1,n);
printf("%lld\n",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=3e5+5;
LL i,j,n,h=1,t=0,S,Q[N],ST[N],SF[N],dp[N];
//dp[p][i]=min(dp[p-1][j]+(ST[i]+S*p)*(SF[i]-SF[j]));
//dp[i]=dp[j]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]);
//(S+ST[i]) * SF[j] + (dp[i]-ST[i]*SF[i]-S*SF[i]) = (dp[j])
// k * x + b = y
//ti� 均>0,且ST[i]是单调递增
inline LL min(Re a,Re b){return a<b?a:b;}
inline LL X(Re j){return SF[j];}
inline LL Y(Re j){return dp[j];}
inline long double slope(Re i,Re j){return X(j)==X(i)?(Y(j)>=Y(i)?1e18:-1e18):(long double)(Y(j)-Y(i))/(X(j)-X(i));}
inline LL sakura(Re k){
if(h==t)return Q[h];
Re l=h,r=t;
while(l<r){
Re mid=l+r>>1,i=Q[mid],j=Q[mid+1];
if(slope(i,j)<k)l=mid+1;
else r=mid;
}
return Q[l];
}
int main(){
scanf("%lld%lld",&n,&S);
for(i=1;i<=n;ST[i]+=ST[i-1],SF[i]+=SF[i-1],++i)scanf("%lld%lld",&ST[i],&SF[i]);
Q[++t]=0;
for(i=1;i<=n;++i){
j=sakura(S+ST[i]);
dp[i]=dp[j]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]);
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=5e4+5;
LL i,j,n,L,h=1,t=0,Q[N],S[N],dp[N];
//dp[i]=S[i]^2-2*S[i]*L+dp[j]+(S[j]+L)^2-2S[i]*S[j]
//(2*S[i]) * S[j] + (dp[i]-S[i]^2+2S[i]L)=(dp[j]+(S[j]+L)^2)
// k * x + b = y
inline LL min(Re a,Re b){return a<b?a:b;}
inline LL X(Re j){return S[j];}
inline LL Y(Re j){return dp[j]+(S[j]+L)*(S[j]+L);}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld%lld",&n,&L);++L;
for(i=1;i<=n;S[i]+=S[i-1]+1,++i)scanf("%lld",&S[i]);
Q[++t]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<=2*S[i])++h;
dp[i]=dp[j=Q[h]]+(S[i]-S[j]-L)*(S[i]-S[j]-L);
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=1e6+5;
LL i,j,n,w,h=1,t=0,W[N],P[N],C[N],Q[N],SP[N],SC[N],dp[N];
inline LL min(Re a,Re b){return a<b?a:b;}
//dp[i]=dp[j]+Ci+Wi*(SP[i]-SP[j])-(SC[i]-SC[j])
//(Wi) * SP[j] + (dp[i]+SC[i]-Wi*SP[i]) = (dp[j]+SC[j])
// k * x + b = y
inline LL X(Re j){return SP[j];}
inline LL Y(Re j){return dp[j]+SC[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld",&n);
for(i=1;i<=n;SC[i]=SC[i-1]+W[i]*SP[i],SP[i]+=SP[i-1],++i)scanf("%lld%lld%lld",&W[i],&SP[i],&C[i]);
Q[++t]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<W[i])++h;
dp[i]=dp[j=Q[h]]+C[i]+W[i]*(SP[i]-SP[j])-SC[i]+SC[j];
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=1e4+5;
LL i,j,n,h=1,t=0,S,Q[N],ST[N],SF[N],dp[N];
//dp[p][i]=min(dp[p-1][j]+(ST[i]+S*p)*(SF[i]-SF[j]));
//dp[i]=min(dp[i],dp[j]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]));
inline LL min(Re a,Re b){return a<b?a:b;}
int main(){
memset(dp,127,sizeof(dp));dp[0]=0;
scanf("%lld%lld",&n,&S);
for(i=1;i<=n;ST[i]+=ST[i-1],SF[i]+=SF[i-1],++i)scanf("%lld%lld",&ST[i],&SF[i]);
for(i=1;i<=n;++i)
for(j=0;j<i;++j)
dp[i]=min(dp[i],dp[j]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]));
printf("%lld",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=3e5+5;
LL i,j,n,h=1,t=0,S,Q[N],ST[N],SF[N],dp[N];
//dp[p][i]=min(dp[p-1][j]+(ST[i]+S*p)*(SF[i]-SF[j]));
//dp[i]=dp[j]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]);
//(S+ST[i]) * SF[j] + (dp[i]-ST[i]*SF[i]-S*SF[i]) = (dp[j])
// k * x + b = y
inline LL min(Re a,Re b){return a<b?a:b;}
inline LL X(Re j){return SF[j];}
inline LL Y(Re j){return dp[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld%lld",&n,&S);
for(i=1;i<=n;ST[i]+=ST[i-1],SF[i]+=SF[i-1],++i)scanf("%lld%lld",&ST[i],&SF[i]);
Q[++t]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<(S+ST[i]))++h;
dp[i]=dp[j=Q[h]]+ST[i]*(SF[i]-SF[j])+S*(SF[n]-SF[j]);
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=5e4+5;
struct QAQ{LL L,W;inline bool operator<(QAQ p)const{return W<p.W;}}a[N];
LL i,j,n,m,h=1,t=0,H=1,T,L[N],W[N],Q[N],dp[N];
inline LL min(Re a,Re b){return a<b?a:b;}
inline LL X(Re j){return -L[j+1];}
inline LL Y(Re j){return dp[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld",&m);
for(i=1;i<=m;++i)scanf("%lld%lld",&a[i].L,&a[i].W);
std::sort(a+1,a+m+1);
for(i=1;i<=m;++i){
while(1<=n&&L[n]<=a[i].L)--n;
L[++n]=a[i].L,W[n]=a[i].W;
}
Q[++t]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<W[i])++h;
dp[i]=dp[j=Q[h]]+L[j+1]*W[i];
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=1e5+5,M=205;
LL tmp,i,j,p,n,K,h,t,Q[N],S[N],to[M][N],dp[M][N];
inline LL max(Re a,Re b){return a>b?a:b;}
//dp[p][i]=dp[p-1][j]+S[j]*(S[i]-S[j])
//(S[i]) * S[j] + (-dp[p][i]) = (S[j]^2-dp[p-1][j])
// k * x + b = y
inline LL X(Re j){return S[j];}
inline LL Y(Re j){return S[j]*S[j]-dp[p-1][j];}
inline long double slope(Re i,Re j){return X(j)==X(i)?-1e18:(long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld%lld",&n,&K);
for(i=1;i<=n;S[i]+=S[i-1],++i)scanf("%lld",&S[i]);
for(p=1;p<=K;++p){
h=1,t=0,Q[++t]=p-1;
for(i=p;i+K-p<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<S[i])++h;
dp[p][i]=dp[p-1][to[p][i]=j=Q[h]]+S[j]*(S[i]-S[j]);
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
}
printf("%lld\n",dp[K][n]);
for(i=n,j=K;j>=1;--j)printf("%lld ",i=to[j][i]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=3e3+5;
LL p,i,j,n,m,h,t,Q[N],S[N],dp[N][N];
//S_walk[m]=S[n]
// m m
// i=1 i=1
// m
// i=1
//dp[p][i]=min(dp[p-1][j]+(S[i]-S[j])^2)
//(2*S[i]) * S[j] + (dp[p][i]-S[i]^2) = (dp[p-1][j]+S[j]^2)
// k * x + b = y
inline LL min(Re a,Re b){return a<b?a:b;}
inline LL X(Re j){return S[j];}
inline LL Y(Re j){return dp[p-1][j]+S[j]*S[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
memset(dp,127,sizeof(dp));dp[0][0]=0;
scanf("%lld%lld",&n,&m);
for(i=1;i<=n;S[i]+=S[i-1],++i)scanf("%lld",&S[i]);
for(p=1;p<=m;++p){
h=1,t=0,Q[++t]=0,dp[p][0]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<2*S[i])++h;
dp[p][i]=min(dp[p-1][i],dp[p-1][j=Q[h]]+(S[i]-S[j])*(S[i]-S[j]));
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
}
printf("%lld",m*dp[m][n]-S[n]*S[n]);
}
#include<cstdio>
#define Re register int
const int N=4e6+105;
int i,j,n,m,h=1,t=0,T,ti,ans=2e9,G[N],S[N],Q[N],dp[N];
inline int min(Re a,Re b){return a<b?a:b;}
// i
// k=j+1
//dp[i]=dp[j]+(G[i]-G[j])*i-(S[i]-S[j])
//(i) * G[j] + (dp[i]+S[j]-i*G[i]) = (dp[j]+S[j])
// k * x + b = y
inline int X(Re j){return G[j];}
inline int Y(Re j){return dp[j]+S[j];}
inline long double slope(Re i,Re j){return X(i)==X(j)?(Y(j)>Y(i)?2e9:-2e9):(long double)(Y(j)-Y(i))/(long double)(X(j)-X(i));}
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;T=-min(-T,-ti),++G[ti],S[ti]+=ti,++i)scanf("%d",&ti);
for(i=1;i<T+m;++i)G[i]+=G[i-1],S[i]+=S[i-1];
for(i=0;i<m;++i)dp[i]=G[i]*i-S[i];
Q[++t]=0;
for(i=m;i<T+m;++i){
while(h<t&&slope(Q[h],Q[h+1])<=i)++h;
dp[i]=dp[j=Q[h]]+(G[i]-G[j])*i-S[i]+S[j];
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i-m+1))--t;
Q[++t]=i-m+1;//(j+1)+m<=i
}
for(i=T;i<T+m;++i)ans=min(ans,dp[i]);
printf("%d",ans);
}
#include<cstring>
#include<cstdio>
#define LL long long
#define Re register LL
const int N=1e6+5;
LL tmp,i,j,n,a,b,c,h=1,t=0,Q[N],S[N],dp[N];
inline LL max(Re a,Re b){return a>b?a:b;}
//dp[i]=dp[j]+a*(S[i]-S[j])^2+b*(S[i]-S[j])+c
//(-2a*S[i]) * S[j] + (b*S[i]+a*S[i]^2-dp[i]) = (b*S[j]-dp[j]-a*S[j]^2)
// k * x + b = y
inline LL X(Re j){return S[j];}
inline LL Y(Re j){return b*S[j]-dp[j]-a*S[j]*S[j];}
inline long double slope(Re i,Re j){return (long double)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
scanf("%lld%lld%lld%lld",&n,&a,&b,&c);
for(i=1;i<=n;S[i]+=S[i-1],++i)scanf("%lld",&S[i]);
Q[++t]=0;
for(i=1;i<=n;++i){
while(h<t&&slope(Q[h],Q[h+1])<(-2*a*S[i]))++h;
dp[i]=dp[j=Q[h]]+a*(S[i]-S[j])*(S[i]-S[j])+b*(S[i]-S[j])+c;
while(h<t&&slope(Q[t-1],Q[t])>slope(Q[t-1],i))--t;
Q[++t]=i;
}
printf("%lld",dp[n]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LL long long
#define LD long double
#define Re register int
using namespace std;
const LL N=1e5+3,inf=1e18;
const LD eps=1e-20;
inline int dcmp(LD a){return a<-eps?-1:(a>eps?1:0);}
int n,h,t,Q[N];LD S,A[N],B[N],Ra[N],f[N],dp[N];
inline void in(Re &x){
int dp=0;x=0;char c=getchar();
while(c<'0'||c>'9')dp|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=dp?-x:x;
}
inline void in(LD &X){
X=0;LD Y=1.0;int dp=0;char c=getchar();
while(c<'0'||c>'9')dp|=c=='-',c=getchar();
while(c>='0'&&c<='9')X=X*10+(c^48),c=getchar();
if(c=='.'){c=getchar();while(c>='0'&&c<='9')X+=(Y/=10)*(c^48),c=getchar();}
X=dp?-X:X;
}
//dp[i]=max((B[i]/A[i])*f[j]+Ra[j]*f[j]),f[i]=dp[i]/(A[i]*Ra[i]+B[i])
//(B[i]/A[i])*f[j]+(-dp[i])=(-Ra[j]*f[j])
// k * x + b = y
#define X(i) (a[i].x)
#define Y(i) (a[i].y)
struct QAQ{
LD k,x,y;int id;
inline bool operator<(const QAQ &O)const{return dcmp(x-O.x)?x<O.x:y<O.y;}
}a[N],b[N];
inline bool cmp(QAQ A,QAQ B){return dcmp(A.k-B.k)<0;}
inline LD slope(Re i,Re j){return X(i)==X(j)?(Y(j)>Y(i)?inf:-inf):(Y(j)-Y(i))/(X(j)-X(i));}
inline void CDQ(Re L,Re R){
if(L==R){
Re j=a[L].id;
// printf("getdp(%d), dp=%.3Lf\n",j,dp[j]);
if(j>1)dp[j]=max(dp[j-1],A[j]*dp[j]),f[j]=dp[j]/(A[j]*Ra[j]+B[j]);
a[L].x=f[j],a[L].y=-Ra[j]*f[j];
// printf("k=%.3Lf, x=%.3Lf, y=%.3Lf\n",a[L].k,a[L].x,a[L].y);
return;
}
Re mid=(L+R)>>1,p1=L,p2=mid+1,h=1,t=0;
for(Re i=L;i<=R;++i)a[i].id<=mid?b[p1++]=a[i]:b[p2++]=a[i];
for(Re i=L;i<=R;++i)a[i]=b[i];
CDQ(L,mid);
for(Re i=L;i<=mid;++i){
while(h<t&&slope(Q[t-1],Q[t])>=slope(Q[t-1],i))--t;
Q[++t]=i;
}
for(Re i=mid+1,j,id;i<=R;++i){
while(h<t&&slope(Q[h],Q[h+1])<=a[i].k)++h;
if(h<=t)id=a[i].id,j=Q[h],dp[id]=max(dp[id],-(a[j].y-a[i].k*a[j].x));
}
CDQ(mid+1,R);Re p=L-1;p1=L,p2=mid+1;
while(p1<=mid&&p2<=R)b[++p]=a[p1]<a[p2]?a[p1++]:a[p2++];
while(p1<=mid)b[++p]=a[p1++];while(p2<=R)b[++p]=a[p2++];
for(Re i=L;i<=R;++i)a[i]=b[i];
}
int main(){
// freopen("123.txt","r",stdin);
in(n),in(S);
for(Re i=1;i<=n;++i)in(A[i]),in(B[i]),in(Ra[i]),dp[i]=-inf;
for(Re i=1;i<=n;++i)a[i].k=B[i]/A[i],a[i].id=i;
f[1]=(dp[1]=S)/(A[1]*Ra[1]+B[1]);
// for(Re i=2;i<=n;++i){
// for(Re j=1;j<i;++j)dp[i]=max(dp[i],f[j]*Ra[j]+f[j]*B[i]/A[i]);
// dp[i]=max(dp[i-1],A[i]*dp[i]),f[i]=dp[i]/(A[i]*Ra[i]+B[i]);
// }
sort(a+1,a+n+1,cmp),CDQ(1,n);
printf("%.3Lf",dp[n]);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LD long double
#define LL long long
#define Re register int
using namespace std;
const LL N=2e5+3,inf=1e18;
int n,x,h=1,t,Q[N];LL ans=inf,Ans,D[N],S[N];
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
// S严格递增
// D严格递减
//F[j]=max(D[i]*S[i]-D[i]*S[j]+D[j]*S[j])
//D[i]*S[j] + F[i]-D[i]*S[i] = D[j]*S[j]
// k * x + b = y
inline LL X(Re j){return S[j];}
inline LL Y(Re j){return D[j]*S[j];}
inline LD slope(Re i,Re j){return (LD)(Y(j)-Y(i))/(X(j)-X(i));}
int main(){
// freopen("123.txt","r",stdin);
in(n);
for(Re i=1;i<=n;++i)in(x),S[i]=S[i-1]+x,in(x),D[i+1]=D[i]+x;
for(Re i=1;i<=n+1;++i)D[i]=D[n+1]-D[i],Ans+=D[i]*(S[i]-S[i-1]);
for(Re i=1;i<=n;++i){
LL tmp=-inf;
while(h<t&&slope(Q[h],Q[h+1])>=D[i])++h;
if(h<=t)ans=min(ans,Ans-(D[i]*(S[i]-S[Q[h]])+D[Q[h]]*S[Q[h]]));
while(h<t&&slope(Q[t-1],i)>=slope(Q[t-1],Q[t]))--t;
Q[++t]=i;
// for(Re j=1;j<i;++j)tmp=max(tmp,D[i]*(S[i]-S[j])+D[j]*S[j]);
}
printf("%lld\n",ans);
}
#include<algorithm>
#include<cstring>
#include<cstdio>
#define LD double
#define LL long long
#define Re register int
using namespace std;
const LL N=1e6+3,inf=4e18;
int n,m,x,y,z,o,h,t,P[N],Q[N],A[N],Fa[N],head[N];LL ans,dp[N],dis[N];
struct QAQ{int w,to,next;}a[N];
inline void add(Re x,Re y,Re z){a[++o].w=z,a[o].to=y,a[o].next=head[x],head[x]=o;}
inline void in(Re &x){
int f=0;x=0;char c=getchar();
while(c<'0'||c>'9')f|=c=='-',c=getchar();
while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar();
x=f?-x:x;
}
//dp[i]=min(dp[j]+P[i]*(dis[i]-dis[j])+A[i])
//dp[i]=dp[j]+P[i]*dis[i]-P[i]*dis[j]+A[i]
//P[i]*dis[j]+dp[i]-P[i]*dis[i]-A[i]=dp[j]
// k * x + b = y
inline LL Y(Re j){return dp[j];}
inline LL X(Re j){return dis[j];}
inline LD slope(Re i,Re j){return (LD)(Y(j)-Y(i))/(X(j)-X(i));}
inline void dfs(Re x,Re fa){
dp[x]=inf;Re h0=h,t0=t;
Re l=h,r=t;
while(l<r){
Re mid=l+r>>1;
if(slope(Q[mid],Q[mid+1])<=P[x])l=mid+1;
else r=mid;
}
h=r;
dp[x]=dp[Q[h]]+(LL)P[x]*(dis[x]-dis[Q[h]])+A[x];
l=h,r=t;
while(l<r){
Re mid=l+r+1>>1;
if(slope(Q[mid-1],x)<=slope(Q[mid-1],Q[mid]))r=mid-1;
else l=mid;
}
Re Qx0=Q[r+1];t=r,Q[++t]=x;
for(Re i=head[x],to;i;i=a[i].next)dis[to=a[i].to]=dis[x]+a[i].w,dfs(to,x);
h=h0,Q[t]=Qx0,t=t0;
}
int main(){
// freopen("123.txt","r",stdin);
in(n);
for(Re i=2;i<=n;++i)in(x),in(z),in(P[i]),in(A[i]),add(x,i,z),Fa[i]=x;
dp[1]=0,h=1,t=0,Q[++t]=1;
for(Re i=head[1],to;i;i=a[i].next)
dis[to=a[i].to]=dis[1]+a[i].w,dfs(to,1);
for(Re i=2;i<=n;++i)printf("%lld\n",dp[i]);
}