【bzoj】1096: [ZJOI2007]仓库建设 (斜率优化模板题)

 

 

#include <bits/stdc++.h>
#define mem(x,v) memset(x,v,sizeof(x)) 
#define go(i,a,b)  for (int i = a; i <= b; i++)
#define og(i,a,b)  for (int i = a; i >= b; i--)
using namespace std;
typedef long long LL;
const double EPS = 1e-10;
const int INF = 0x3f3f3f3f;
const int N = 1e6+10;
int n,Q[N];
LL x[N],p[N],c[N],g[N],f[N];
double Rate(int j, int i){
	return ((f[i] - g[i] - f[j] + g[j])/(1.0*p[i] - 1.0*p[j]));
}
int main(){
	scanf("%d",&n);
	go(i,1,n) {
		scanf("%lld%lld%lld",&x[i],&p[i],&c[i]);
		g[i] =g[i-1]-x[i]*p[i];
		p[i] += p[i-1];
	}
	int tail = 1, head = 1; Q[1] = 0;
	go(i,1,n){
		f[i] = x[i]*(p[i-1]) + g[i-1] + c[i];
		while(tail > head && Rate(Q[head],Q[head+1]) < x[i]) head++;
		int j = Q[head]; f[i] =min(f[i],f[j] + g[i-1] - g[j] + x[i]*(p[i-1] - p[j])+c[i]);
		while(tail > head && Rate(Q[tail - 1],Q[tail]) > Rate(Q[tail],i)) tail--;
		Q[++tail] = i;
	}
	printf("%lld\n",f[n]);
	return 0;
}