易得转移方程:
f[i]=min(f[j]+∑k=j+1i((x[i]−x[k])∗p[k])+c[i]
令a[i]=∑j=1ix[j]∗p[j]
sum[i]=∑j=1ip[i]
令g[i,j]=∑k=j+1i((x[i]−x[k])∗p[k])
则g[i,j]=(sum[i]−sum[j])∗x[i]−a[i]+a[j]
对于k>j并且k的决策优于j的决策 :
f[k]+g[i,k]+c[i]<f[j]+g[i,j]+c[i]
将g[i,k] g[i,j]带入并化简:
f[k]−sum[k]∗x[i]+a[k]<f[j]−sum[j]∗x[i]+a[j]
x[i]>f[k]+a[k]−f[j]−a[j]sum[k]−sum[j]
x[i]单调递增,显然满足决策单调性,可以斜率优化
维护一个下凸壳
【代码】
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
#define INF 1000000000001
#define mod 1000000007
#define N 1000005
using namespace std;
typedef long long ll;
int read()
{
int x=0,f=1;char ch=getchar();
while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return x*f;
}
int n,l,r;
int X[N],P[N],C[N],q[N];
ll sum[N],f[N],a[N];
double slope(int j,int k){
return (double)(f[k]+a[k]-f[j]-a[j])/(sum[k]-sum[j]);
}
int main()
{
n=read();
for(register int i=1;i<=n;i++) X[i]=read(),P[i]=read(),C[i]=read();
for(register int i=1;i<=n;i++) a[i]=a[i-1]+(ll)X[i]*P[i],sum[i]=sum[i-1]+P[i];
for(register int i=1;i<=n;i++)
{
while(l<r&&slope(q[l],q[l+1])<X[i]) l++;
int t=q[l];
f[i]=f[t]+(sum[i]-sum[t])*X[i]-a[i]+a[t]+C[i];
while(l<r&&slope(q[r],i)<slope(q[r-1],q[r])) r--;
q[++r]=i;
}
printf("%lld\n",f[n]);
return 0;
}