【BZOJ3963】【WF2011】MachineWorks

【题目链接】

• 点击打开链接
  

【思路要点】

• 按照\(G_i\)对机器排序，斜率优化DP即可。
• 时间复杂度\(O(NLog{N})\)。
• 也可以按\(D_i\)排序，用Splay或CDQ分治支持询问。

【代码】

#include<bits/stdc++.h>
using namespace std;
#define MAXN	100005
struct info {long long d, p, r, g, c; };
struct ans {long long g, v; };
int n, num, q; info a[MAXN];
long long c, d, f[MAXN], v[MAXN];
ans Stack[MAXN]; int top;
bool cmp(info x, info y) {return x.g < y.g; }
double T(ans A, ans B) {
	return (double)(A.v - B.v) / (double)(A.g - B.g);
}
void insert(long long g, long long v) {
	ans now = (ans) {g, v};
	if (top >= 1 && Stack[top].g == g) {
		if (v >= Stack[top].v) return;
		top--;
	}
	while (top > 1 && T(now, Stack[top]) <= T(Stack[top], Stack[top - 1])) top--;
	Stack[++top] = now;
}
ans query(long long d) {
	int l = 1, r = top;
	while (l < r) {
		int mid = (l + r + 1) / 2;
		if (T(Stack[mid], Stack[mid - 1]) <= d) l = mid;
		else r = mid - 1;
	}
	return Stack[r];
}
int main() {
	int T = 0;
	for (scanf("%d%lld%lld", &n, &c, &d); n != 0; scanf("%d%lld%lld", &n, &c, &d)) {
		for (int i = 1; i <= n; i++) {
			scanf("%lld%lld%lld%lld", &a[i].d, &a[i].p, &a[i].r, &a[i].g);
			a[i].c = a[i].p - a[i].r;
		}
		sort(a + 1, a + n + 1, cmp);
		n++; a[n].d = d + 1; top = 0;
		f[1] = c; v[1] = - (f[1] - a[1].g * a[1].d - a[1].c - a[1].g);
		if (f[1] >= a[1].p) insert(a[1].g, v[1]);
		for (int i = 2; i <= n; i++) {
			f[i] = c;
			ans tmp = query(a[i].d);
			f[i] = max(f[i], tmp.g * a[i].d - tmp.v);
			v[i] = - (f[i] - a[i].g * a[i].d - a[i].c - a[i].g);
			if (f[i] >= a[i].p) insert(a[i].g, v[i]);
		}
		printf("Case %d: %lld\n", ++T, f[n]);
	}
	return 0;
}