【题意分析】
首先这道题是有sa做法的,可是我不想写
我们先对于数据做一些处理:dis[i]
表示距离的后缀和(这个点到山下锯木厂的距离),sum[i]
表示质量的前缀和,cnt
为所有木材全部运输到山下那个锯木厂的价格(即山上不建任何锯木厂)
那么有
a n s = min 1 ≤ j < i { c n t − d i s [ j ] ∗ s u m [ j ] − d i s [ i ] ∗ ( s u m [ i ] − s u m [ j ] ) } ans=\min_{1\leq j<i}\{cnt-dis[j]*sum[j]-dis[i]*(sum[i]-sum[j])\} ans=1≤j<imin{cnt−dis[j]∗sum[j]−dis[i]∗(sum[i]−sum[j])}
如果看不懂,请自行理解一会儿:i、j处有两个锯木厂,而且i在j后面,那么新的价格就是总价格减掉j处产生的多余费用再减去i处产生的多余费用
斜率优化一下:
d i s x ∗ s u m x − d i s y ∗ s u m y s u m x − s u m y > d i s i \frac{dis_x*sum_x-dis_y*sum_y}{sum_x-sum_y}>dis_i sumx−sumydisx∗sumx−disy∗sumy>disi
注意到不等式右边是单调递减的(因为是下凸包),其实你维护上凸包也可以,因为我懒,所以
− d i s x ∗ s u m x − d i s y ∗ s u m y s u m x − s u m y < − d i s i -\frac{dis_x*sum_x-dis_y*sum_y}{sum_x-sum_y}<-dis_i −sumx−sumydisx∗sumx−disy∗sumy<−disi
这样右边就是下凸包了,按照套路来即可
Code :
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cstring>
#include <algorithm>
#define int long long
#define db double
#define INF 2147400000
#define MAXN 200000
using namespace std;
int sum[MAXN], w[MAXN], dis[MAXN], q[MAXN], n, cnt = 0;
inline int read () {
register int s = 0, w = 1;
register char ch = getchar ();
while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
return s * w;
}
inline db slope (int x, int y) {return -1.0 * (dis[x] * sum[x] - dis[y] * sum[y]) / (sum[x] - sum[y]);}
signed main () {
n = read ();
for (register int i = 1; i <= n; i++) w[i] = read (), dis[i] = read (), sum[i] = sum[i - 1] + w[i];
for (register int i = n; i >= 1; i--) dis[i] += dis[i + 1], cnt += dis[i] * w[i];
int h = 0, t = 0, ans = INF;
for (register int i = 1; i <= n; i++) {
while (h < t && slope (q[h + 1], q[h]) < -dis[i]) h++;
ans = min (ans, cnt - dis[q[h]] * sum[q[h]] - dis[i] * (sum[i] - sum[q[h]]));
while (h < t && slope (q[t], q[t - 1]) > slope (i, q[t])) t--;
q[++t] = i;
}
return printf ("%lld\n", ans), 0;
}