题意:空间里有n个点,给出每个点的坐标和权值,然后有一个长宽高分别是lb,lw,lh的长方体可以任意放置去覆盖一些点,问能覆盖的所有点的最小权值和。
题解:线段树维护当前区间覆盖点的最大值,先把所有点按x坐标排序,然后把所有在lb距离内的所有点建立扫描线,剩下的和poj2482一样。把权值全部变为相反数求最大值,最后再输出解的相反数。
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <map>
#include <vector>
using namespace std;
const int N = 2005;
const int INF = 0x3f3f3f3f;
struct Line {
int lx, rx, h;
int flag;
Line(int a, int b, int c, int d): lx(a), rx(b), h(c), flag(d) {}
bool operator < (const Line& a) const { return h < a.h || (h == a.h && flag > a.flag); }
};
struct Point {
int x, y, z, v;
bool operator < (const Point& a) const { return x < a.x; }
}p[N];
int n, flag[N << 2], tree[N << 2];
vector<Line> line;
void pushup(int k) {
tree[k] = max(tree[k * 2], tree[k * 2 + 1]);
}
void pushdown(int k) {
if (flag[k]) {
flag[k * 2] += flag[k];
flag[k * 2 + 1] += flag[k];
tree[k * 2] += flag[k];
tree[k * 2 + 1] += flag[k];
flag[k] = 0;
}
}
void modify(int k, int left, int right, int l, int r, int v) {
if (l <= left && right <= r) {
flag[k] += v;
tree[k] += v;
return;
}
pushdown(k);
int mid = (left + right) / 2;
if (l <= mid)
modify(k * 2, left, mid, l, r, v);
if (r > mid)
modify(k * 2 + 1, mid + 1, right, l, r, v);
pushup(k);
}
int main() {
while (scanf("%d", &n) == 1) {
memset(flag, 0, sizeof(flag));
memset(tree, 0, sizeof(tree));
int cnt = 0;
for (int i = 0; i < n; i++) {
scanf("%d%d%d%d", &p[cnt].x, &p[cnt].y, &p[cnt].z, &p[cnt].v);
if (p[cnt].v < 0) {
p[cnt].x += 1000, p[cnt].y += 1000, p[cnt].z += 1000;
p[cnt].v = -p[cnt].v;
cnt++;
}
}
int lb, lw, lh;
scanf("%d%d%d", &lb, &lw, &lh);
if (cnt == 0) {
printf("Error 404, mahou shoujo not found!\n");
continue;
}
n = cnt;
sort(p, p + n);
int res = 0;
for (int i = 0, cur = 0; i < n && cur < n; i++) {
line.clear();
while (cur < n && p[cur].x - p[i].x <= lb) cur++;
for (int j = i; j < cur; j++) {
line.push_back(Line(p[j].y, p[j].y + lw, p[j].z, p[j].v));
line.push_back(Line(p[j].y, p[j].y + lw, p[j].z + lh, -p[j].v));
}
sort(line.begin(), line.end());
int sz = line.size();
for (int j = 0; j < sz; j++) {
modify(1, 0, N, line[j].lx, line[j].rx, line[j].flag);
res = max(res, tree[1]);
}
}
printf("%d\n", -res);
}
return 0;
}