[BZOJ1096][ZJOI2007]仓库建设（斜率优化dp）

题目：

我是超链接

题解：

后缀......注意一下d[i]的含义：i~n的距离

代码：

#include <cstdio>
#include <iostream>
#define LL long long
#define N 1000005
#define Max 1e9
using namespace std;
LL f[N],s[N],x[N],cc[N],p[N],c[N],d[N];int q[N]; 
LL K(int j){return -cc[j+1];}
LL B(int j){return f[j]+s[j+1];}
LL Y(int i,int j){return d[i]*K(j)+B(j);}
bool cover(int x1,int x2,int x3)
{
	LL w1=(LL)(K(x1)-K(x3))*(B(x2)-B(x1));
	LL w2=(LL)(K(x1)-K(x2))*(B(x3)-B(x1));
	return w1<=w2;
}
int main()
{
	int n,i;
	scanf("%d",&n);
	for (i=1;i<=n;i++)
	  scanf("%lld%lld%lld",&x[i],&p[i],&c[i]);
	d[n+1]=0; cc[n+1]=0; s[n+1]=0;
	for (i=n;i>=1;i--) d[i]=x[n]-x[i];
	for (i=n;i>=1;i--) cc[i]=cc[i+1]+p[i];
	for (i=n;i>=1;i--) s[i]=s[i+1]+d[i]*p[i];
 	int l,r; l=r=0;
	for (i=1;i<=n;i++)
	{
		while (l<r && Y(i,q[l])>=Y(i,q[l+1])) l++;
		f[i]=Y(i,q[l])-s[i]+d[i]*cc[i]+c[i];
		while (l<r && cover(i,q[r-1],q[r])) r--;
		q[++r]=i;
	}
	printf("%lld",f[n]);
}